About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1152622.00 | 0.00 | 0.00 | FTFFTTTFTTFTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264100410.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 RingSingleMessageInMbox-PT-d1m005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264100410
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 7.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M May 29 14:32 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 RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-15
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749071389067
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-04 21:09:50] [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-04 21:09:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 21:09:50] [INFO ] Load time of PNML (sax parser for PT used): 505 ms
[2025-06-04 21:09:50] [INFO ] Transformed 6690 places.
[2025-06-04 21:09:51] [INFO ] Transformed 11934 transitions.
[2025-06-04 21:09:51] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 684 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 4305 places in 26 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 60 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1066 places :
Symmetric choice reduction at 1 with 1066 rule applications. Total rules 1185 place count 1302 transition count 10353
Iterating global reduction 1 with 1066 rules applied. Total rules applied 2251 place count 1302 transition count 10353
Ensure Unique test removed 423 transitions
Reduce isomorphic transitions removed 423 transitions.
Iterating post reduction 1 with 423 rules applied. Total rules applied 2674 place count 1302 transition count 9930
Discarding 860 places :
Symmetric choice reduction at 2 with 860 rule applications. Total rules 3534 place count 442 transition count 9070
Iterating global reduction 2 with 860 rules applied. Total rules applied 4394 place count 442 transition count 9070
Ensure Unique test removed 6974 transitions
Reduce isomorphic transitions removed 6974 transitions.
Iterating post reduction 2 with 6974 rules applied. Total rules applied 11368 place count 442 transition count 2096
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 11382 place count 428 transition count 2082
Iterating global reduction 3 with 14 rules applied. Total rules applied 11396 place count 428 transition count 2082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11397 place count 428 transition count 2081
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 11405 place count 420 transition count 2073
Iterating global reduction 4 with 8 rules applied. Total rules applied 11413 place count 420 transition count 2073
Applied a total of 11413 rules in 356 ms. Remains 420 /2385 variables (removed 1965) and now considering 2073/11934 (removed 9861) transitions.
// Phase 1: matrix 2073 rows 420 cols
[2025-06-04 21:09:51] [INFO ] Computed 3 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:09:52] [INFO ] Implicit Places using invariants in 621 ms returned []
[2025-06-04 21:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:09:52] [INFO ] State equation strengthened by 1694 read => feed constraints.
[2025-06-04 21:10:05] [INFO ] Implicit Places using invariants and state equation in 13303 ms returned []
Implicit Place search using SMT with State Equation took 13959 ms to find 0 implicit places.
Running 2072 sub problems to find dead transitions.
[2025-06-04 21:10:05] [INFO ] Invariant cache hit.
[2025-06-04 21:10:05] [INFO ] State equation strengthened by 1694 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2072 unsolved
SMT process timed out in 34971ms, After SMT, problems are : Problem set: 0 solved, 2072 unsolved
Search for dead transitions found 0 dead transitions in 34995ms
Starting structural reductions in LTL mode, iteration 1 : 420/2385 places, 2073/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49344 ms. Remains : 420/2385 places, 2073/11934 transitions.
Support contains 60 out of 420 places after structural reductions.
[2025-06-04 21:10:40] [INFO ] Flatten gal took : 177 ms
[2025-06-04 21:10:41] [INFO ] Flatten gal took : 98 ms
[2025-06-04 21:10:41] [INFO ] Input system was already deterministic with 2073 transitions.
Support contains 58 out of 420 places (down from 60) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 64 to 62
RANDOM walk for 40000 steps (6498 resets) in 3492 ms. (11 steps per ms) remains 6/62 properties
BEST_FIRST walk for 40004 steps (307 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (657 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (769 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (663 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (627 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (732 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
[2025-06-04 21:10:42] [INFO ] Invariant cache hit.
[2025-06-04 21:10:42] [INFO ] State equation strengthened by 1694 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 113/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 46/182 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:43] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 960/1142 variables, 182/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1142 variables, 581/767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1142 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 11 (OVERLAPS) 1351/2493 variables, 238/1005 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2493 variables, 1113/2118 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2493 variables, 0/2118 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2493 variables, 0/2118 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2493/2493 variables, and 2118 constraints, problems are : Problem set: 5 solved, 1 unsolved in 3825 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 1694/1694 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 114/116 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/124 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 46/170 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:46] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:46] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:46] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:47] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 4/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 410/580 variables, 170/178 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 31/209 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 1/210 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/210 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1909/2489 variables, 246/456 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2489 variables, 1663/2119 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2489 variables, 0/2119 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/2493 variables, 4/2123 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2493 variables, 0/2123 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2493 variables, 0/2123 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2493/2493 variables, and 2123 constraints, problems are : Problem set: 5 solved, 1 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 420/420 constraints, ReadFeed: 1694/1694 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6005ms problems are : Problem set: 5 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-06-04 21:10:48] [INFO ] Flatten gal took : 59 ms
[2025-06-04 21:10:48] [INFO ] Flatten gal took : 63 ms
[2025-06-04 21:10:48] [INFO ] Input system was already deterministic with 2073 transitions.
Support contains 53 out of 420 places (down from 55) after GAL structural reductions.
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 133 stabilizing places and 990 stable transitions
Graph (complete) has 2919 edges and 420 vertex of which 419 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 420/420 places, 2073/2073 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 376 transition count 1059
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 376 transition count 1059
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 124 place count 376 transition count 1023
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 186 place count 314 transition count 961
Iterating global reduction 1 with 62 rules applied. Total rules applied 248 place count 314 transition count 961
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 381 place count 314 transition count 828
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 461 place count 234 transition count 748
Iterating global reduction 2 with 80 rules applied. Total rules applied 541 place count 234 transition count 748
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 2 with 216 rules applied. Total rules applied 757 place count 234 transition count 532
Applied a total of 757 rules in 122 ms. Remains 234 /420 variables (removed 186) and now considering 532/2073 (removed 1541) transitions.
// Phase 1: matrix 532 rows 234 cols
[2025-06-04 21:10:49] [INFO ] Computed 3 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:10:49] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-04 21:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:10:49] [INFO ] State equation strengthened by 318 read => feed constraints.
[2025-06-04 21:10:50] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:10:50] [INFO ] Redundant transitions in 28 ms returned []
Running 531 sub problems to find dead transitions.
[2025-06-04 21:10:50] [INFO ] Invariant cache hit.
[2025-06-04 21:10:50] [INFO ] State equation strengthened by 318 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (OVERLAPS) 1/234 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
At refinement iteration 4 (OVERLAPS) 532/766 variables, 234/237 constraints. Problems are: Problem set: 24 solved, 507 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 318/555 constraints. Problems are: Problem set: 24 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/766 variables, and 555 constraints, problems are : Problem set: 24 solved, 507 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, ReadFeed: 318/318 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 507 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 507 unsolved
At refinement iteration 1 (OVERLAPS) 17/226 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 507 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 507 unsolved
At refinement iteration 3 (OVERLAPS) 8/234 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 507 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 507 unsolved
At refinement iteration 5 (OVERLAPS) 532/766 variables, 234/237 constraints. Problems are: Problem set: 24 solved, 507 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 318/555 constraints. Problems are: Problem set: 24 solved, 507 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 507/1062 constraints. Problems are: Problem set: 24 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/766 variables, and 1062 constraints, problems are : Problem set: 24 solved, 507 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, ReadFeed: 318/318 constraints, PredecessorRefiner: 507/531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60545ms problems are : Problem set: 24 solved, 507 unsolved
Search for dead transitions found 24 dead transitions in 60547ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 234/420 places, 508/2073 transitions.
Graph (complete) has 958 edges and 234 vertex of which 210 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 210 transition count 496
Applied a total of 13 rules in 29 ms. Remains 210 /234 variables (removed 24) and now considering 496/508 (removed 12) transitions.
// Phase 1: matrix 496 rows 210 cols
[2025-06-04 21:11:51] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:11:51] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-04 21:11:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:11:51] [INFO ] State equation strengthened by 314 read => feed constraints.
[2025-06-04 21:11:53] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 2241 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 210/420 places, 496/2073 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 64833 ms. Remains : 210/420 places, 496/2073 transitions.
[2025-06-04 21:11:53] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:11:53] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:11:53] [INFO ] Input system was already deterministic with 496 transitions.
[2025-06-04 21:11:53] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:11:53] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:11:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9393464610889358938.gal : 12 ms
[2025-06-04 21:11:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8897980364231979834.ctl : 3 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/CTLFireability9393464610889358938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8897980364231979834.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,282116,4.48451,135552,2,8429,5,232332,6,0,1336,147526,0
Converting to forward existential form...Done !
original formula: E(A(AF(!((((s1>=1)&&(l3936>=1)) + A(((s1>=1)&&(l3919>=1)) U ((s1>=1)&&(l3939>=1)))))) U (AG((((s1>=1)&&(l3936>=1))||((s1>=1)&&(l3913>=1))...297
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((E(!((!(E(TRUE U !((((s1>=1)&&(l3936>=1))||((s1>=1)&&(l3913>=1)))))) * E(TRUE U (((s1>=1)&&(l...714
Reverse transition relation is NOT exact ! Due to transitions t1, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t42, t43, t44, t45, t46,...1888
Using saturation style SCC detection
(forward)formula 0,1,24.5387,622404,1,0,977,2.2918e+06,1029,460,9826,1.43774e+06,1439
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-00 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 : 420/420 places, 2073/2073 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 382 transition count 1209
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 382 transition count 1209
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 117 place count 382 transition count 1168
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 174 place count 325 transition count 1111
Iterating global reduction 1 with 57 rules applied. Total rules applied 231 place count 325 transition count 1111
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 161 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 392 place count 325 transition count 950
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 460 place count 257 transition count 882
Iterating global reduction 2 with 68 rules applied. Total rules applied 528 place count 257 transition count 882
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 720 place count 257 transition count 690
Applied a total of 720 rules in 57 ms. Remains 257 /420 variables (removed 163) and now considering 690/2073 (removed 1383) transitions.
// Phase 1: matrix 690 rows 257 cols
[2025-06-04 21:12:18] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:12:19] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-04 21:12:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:12:19] [INFO ] State equation strengthened by 456 read => feed constraints.
[2025-06-04 21:12:20] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
Running 689 sub problems to find dead transitions.
[2025-06-04 21:12:20] [INFO ] Invariant cache hit.
[2025-06-04 21:12:20] [INFO ] State equation strengthened by 456 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 2 (OVERLAPS) 1/257 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 689 unsolved
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
At refinement iteration 4 (OVERLAPS) 690/947 variables, 257/260 constraints. Problems are: Problem set: 24 solved, 665 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/947 variables, 456/716 constraints. Problems are: Problem set: 24 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 947/947 variables, and 716 constraints, problems are : Problem set: 24 solved, 665 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 257/257 constraints, ReadFeed: 456/456 constraints, PredecessorRefiner: 689/689 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 665 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 665 unsolved
At refinement iteration 1 (OVERLAPS) 17/249 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 665 unsolved
At refinement iteration 3 (OVERLAPS) 8/257 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 665 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 665 unsolved
At refinement iteration 5 (OVERLAPS) 690/947 variables, 257/260 constraints. Problems are: Problem set: 24 solved, 665 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/947 variables, 456/716 constraints. Problems are: Problem set: 24 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 947/947 variables, and 1381 constraints, problems are : Problem set: 24 solved, 665 unsolved in 30479 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 257/257 constraints, ReadFeed: 456/456 constraints, PredecessorRefiner: 665/689 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61226ms problems are : Problem set: 24 solved, 665 unsolved
Search for dead transitions found 24 dead transitions in 61231ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 257/420 places, 666/2073 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 233 transition count 654
Applied a total of 36 rules in 4 ms. Remains 233 /257 variables (removed 24) and now considering 654/666 (removed 12) transitions.
// Phase 1: matrix 654 rows 233 cols
[2025-06-04 21:13:22] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:13:22] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-04 21:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:13:22] [INFO ] State equation strengthened by 452 read => feed constraints.
[2025-06-04 21:13:25] [INFO ] Implicit Places using invariants and state equation in 2812 ms returned []
Implicit Place search using SMT with State Equation took 2929 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 233/420 places, 654/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66326 ms. Remains : 233/420 places, 654/2073 transitions.
[2025-06-04 21:13:25] [INFO ] Flatten gal took : 15 ms
[2025-06-04 21:13:25] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:13:25] [INFO ] Input system was already deterministic with 654 transitions.
[2025-06-04 21:13:25] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:13:25] [INFO ] Flatten gal took : 16 ms
[2025-06-04 21:13:25] [INFO ] Time to serialize gal into /tmp/CTLFireability2213029124077819817.gal : 4 ms
[2025-06-04 21:13:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9425773628036648402.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/CTLFireability2213029124077819817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9425773628036648402.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,372949,4.72978,139484,2,8749,5,243760,6,0,1586,160376,0
Converting to forward existential form...Done !
original formula: !(A((E(!(((s1>=1)&&(l3913>=1))) U ((((s1>=1)&&(l3935>=1))||(((s1>=1)&&(l3915>=1))&&((s1>=1)&&(l3930>=1)))) * EX(((s1>=1)&&(l3929>=1))))) ...545
=> equivalent forward existential formula: (((([FwdG((FwdU(Init,!((((!(EG(!((!((E(!(((p610>=1)&&(l0>=1))) U (!(((s1>=1)&&(l3912>=1))) * !(((p610>=1)&&(l0>=...5553
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t26, t27, t28, t29, t30, t31, t32, t33, t34, t44, t45, t47, t48, t53,...2661
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,29.4132,702172,1,0,1077,2.69008e+06,1348,520,11676,1.50075e+06,1714
FORMULA RingSingleMessageInMbox-PT-d1m005-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 : 420/420 places, 2073/2073 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 372 transition count 805
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 372 transition count 805
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 111 place count 372 transition count 790
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 178 place count 305 transition count 723
Iterating global reduction 1 with 67 rules applied. Total rules applied 245 place count 305 transition count 723
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 328 place count 305 transition count 640
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 428 place count 205 transition count 540
Iterating global reduction 2 with 100 rules applied. Total rules applied 528 place count 205 transition count 540
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 688 place count 205 transition count 380
Applied a total of 688 rules in 29 ms. Remains 205 /420 variables (removed 215) and now considering 380/2073 (removed 1693) transitions.
// Phase 1: matrix 380 rows 205 cols
[2025-06-04 21:13:55] [INFO ] Computed 3 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:13:55] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-04 21:13:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:13:55] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-06-04 21:13:57] [INFO ] Implicit Places using invariants and state equation in 2560 ms returned []
Implicit Place search using SMT with State Equation took 2699 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2025-06-04 21:13:57] [INFO ] Invariant cache hit.
[2025-06-04 21:13:57] [INFO ] State equation strengthened by 190 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (OVERLAPS) 380/585 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 190/398 constraints. Problems are: Problem set: 24 solved, 355 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:11] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:11] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:11] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:11] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:11] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:11] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:15] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:15] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:15] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:15] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:16] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:16] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:16] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:16] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:16] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:16] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 5 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:16] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 5 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:17] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:17] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:17] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 20 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 20/418 constraints. Problems are: Problem set: 40 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/585 variables, and 418 constraints, problems are : Problem set: 40 solved, 339 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 339 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 40 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 40 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 27/193 variables, 2/4 constraints. Problems are: Problem set: 40 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 9/13 constraints. Problems are: Problem set: 40 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/13 constraints. Problems are: Problem set: 40 solved, 339 unsolved
At refinement iteration 5 (OVERLAPS) 12/205 variables, 1/14 constraints. Problems are: Problem set: 40 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 9/23 constraints. Problems are: Problem set: 40 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/23 constraints. Problems are: Problem set: 40 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 380/585 variables, 205/228 constraints. Problems are: Problem set: 40 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 190/418 constraints. Problems are: Problem set: 40 solved, 339 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 339/757 constraints. Problems are: Problem set: 40 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 757 constraints, problems are : Problem set: 40 solved, 339 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 339/379 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60363ms problems are : Problem set: 40 solved, 339 unsolved
Search for dead transitions found 40 dead transitions in 60365ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in LTL mode, iteration 1 : 205/420 places, 340/2073 transitions.
Reduce places removed 40 places and 2 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 165 transition count 320
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 163 transition count 316
Applied a total of 60 rules in 5 ms. Remains 163 /205 variables (removed 42) and now considering 316/340 (removed 24) transitions.
// Phase 1: matrix 316 rows 163 cols
[2025-06-04 21:14:58] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:14:58] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-04 21:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:14:58] [INFO ] State equation strengthened by 182 read => feed constraints.
[2025-06-04 21:14:59] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/420 places, 316/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64937 ms. Remains : 163/420 places, 316/2073 transitions.
[2025-06-04 21:14:59] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:14:59] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:14:59] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-04 21:14:59] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:14:59] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:14:59] [INFO ] Time to serialize gal into /tmp/CTLFireability3558529567628329194.gal : 2 ms
[2025-06-04 21:14:59] [INFO ] Time to serialize properties into /tmp/CTLFireability4397835163231258771.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/CTLFireability3558529567628329194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4397835163231258771.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,283394,2.89668,92048,2,6367,5,213036,6,0,968,152284,0
Converting to forward existential form...Done !
original formula: AX((E(((s1>=1)&&(l3936>=1)) U !(((s1>=1)&&(l3935>=1)))) * !(A(EF((((s1>=1)&&(l3918>=1))||((s1>=1)&&(l3912>=1)))) U ((s1>=1)&&(l3379>=1)))...158
=> equivalent forward existential formula: ([(EY(Init) * !(E(((s1>=1)&&(l3936>=1)) U !(((s1>=1)&&(l3935>=1))))))] = FALSE * [((EY(Init) * !(EG(!(((s1>=1)&&...305
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t30, ...1218
(forward)formula 0,1,9.86997,270400,1,0,638,1.18612e+06,667,268,6914,705743,827
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2073/2073 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 370 transition count 665
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 370 transition count 665
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 114 place count 370 transition count 651
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 184 place count 300 transition count 581
Iterating global reduction 1 with 70 rules applied. Total rules applied 254 place count 300 transition count 581
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 307 place count 300 transition count 528
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 419 place count 188 transition count 416
Iterating global reduction 2 with 112 rules applied. Total rules applied 531 place count 188 transition count 416
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 647 place count 188 transition count 300
Applied a total of 647 rules in 31 ms. Remains 188 /420 variables (removed 232) and now considering 300/2073 (removed 1773) transitions.
// Phase 1: matrix 300 rows 188 cols
[2025-06-04 21:15:09] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:15:10] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-04 21:15:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:15:10] [INFO ] State equation strengthened by 124 read => feed constraints.
[2025-06-04 21:15:12] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned []
Implicit Place search using SMT with State Equation took 2086 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2025-06-04 21:15:12] [INFO ] Invariant cache hit.
[2025-06-04 21:15:12] [INFO ] State equation strengthened by 124 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
At refinement iteration 4 (OVERLAPS) 300/488 variables, 188/191 constraints. Problems are: Problem set: 24 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 124/315 constraints. Problems are: Problem set: 24 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:22] [INFO ] Deduced a trap composed of 81 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:22] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:22] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:23] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:23] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 4 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:23] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 5 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:24] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:25] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:25] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:25] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 15 ms to minimize.
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:25] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 5 ms to minimize.
Problem TDEAD247 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:25] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:26] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:26] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:26] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 5 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 15/330 constraints. Problems are: Problem set: 46 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:36] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:36] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:37] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:37] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 4/334 constraints. Problems are: Problem set: 46 solved, 253 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 334 constraints, problems are : Problem set: 46 solved, 253 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 46 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 46 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 27/172 variables, 2/3 constraints. Problems are: Problem set: 46 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 7/10 constraints. Problems are: Problem set: 46 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 46 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 16/188 variables, 1/11 constraints. Problems are: Problem set: 46 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 11/22 constraints. Problems are: Problem set: 46 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/22 constraints. Problems are: Problem set: 46 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 300/488 variables, 188/210 constraints. Problems are: Problem set: 46 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 124/334 constraints. Problems are: Problem set: 46 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 253/587 constraints. Problems are: Problem set: 46 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 587 constraints, problems are : Problem set: 46 solved, 253 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 253/299 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60244ms problems are : Problem set: 46 solved, 253 unsolved
Search for dead transitions found 46 dead transitions in 60246ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 188/420 places, 254/2073 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 146 transition count 236
Applied a total of 60 rules in 5 ms. Remains 146 /188 variables (removed 42) and now considering 236/254 (removed 18) transitions.
// Phase 1: matrix 236 rows 146 cols
[2025-06-04 21:16:12] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:16:12] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-06-04 21:16:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:16:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-04 21:16:13] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/420 places, 236/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63469 ms. Remains : 146/420 places, 236/2073 transitions.
[2025-06-04 21:16:13] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:16:13] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:16:13] [INFO ] Input system was already deterministic with 236 transitions.
[2025-06-04 21:16:13] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:16:13] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:16:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5828178213156441339.gal : 1 ms
[2025-06-04 21:16:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8014673548250322893.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/CTLFireability5828178213156441339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8014673548250322893.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,192629,0.500658,24884,2,5075,5,54323,6,0,820,35171,0
Converting to forward existential form...Done !
original formula: AX(AG((EG((EX(((s1>=1)&&(l2807>=1))) * EX(((s1>=1)&&(l3446>=1))))) + (EG(((s1<1)||(l3913<1))) * AX(((p1068<1)||(l3799<1)))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * !(EG((EX(((s1>=1)&&(l2807>=1))) * EX(((s1>=1)&&(l3446>=1))))))) * !(EG(((s1<1)||(l3913...305
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t27, t28, t29, t30, t31,...874
(forward)formula 0,0,3.40334,127464,1,0,447,359190,499,176,5865,259447,519
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-03 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 : 420/420 places, 2073/2073 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 381 transition count 1161
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 381 transition count 1161
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 111 place count 381 transition count 1128
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 170 place count 322 transition count 1069
Iterating global reduction 1 with 59 rules applied. Total rules applied 229 place count 322 transition count 1069
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 1 with 152 rules applied. Total rules applied 381 place count 322 transition count 917
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 453 place count 250 transition count 845
Iterating global reduction 2 with 72 rules applied. Total rules applied 525 place count 250 transition count 845
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 2 with 212 rules applied. Total rules applied 737 place count 250 transition count 633
Applied a total of 737 rules in 25 ms. Remains 250 /420 variables (removed 170) and now considering 633/2073 (removed 1440) transitions.
// Phase 1: matrix 633 rows 250 cols
[2025-06-04 21:16:16] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:16:17] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-04 21:16:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:16:17] [INFO ] State equation strengthened by 405 read => feed constraints.
[2025-06-04 21:16:21] [INFO ] Implicit Places using invariants and state equation in 4323 ms returned []
Implicit Place search using SMT with State Equation took 4487 ms to find 0 implicit places.
Running 632 sub problems to find dead transitions.
[2025-06-04 21:16:21] [INFO ] Invariant cache hit.
[2025-06-04 21:16:21] [INFO ] State equation strengthened by 405 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
At refinement iteration 4 (OVERLAPS) 633/883 variables, 250/253 constraints. Problems are: Problem set: 24 solved, 608 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 405/658 constraints. Problems are: Problem set: 24 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 883/883 variables, and 658 constraints, problems are : Problem set: 24 solved, 608 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 250/250 constraints, ReadFeed: 405/405 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 608 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 608 unsolved
At refinement iteration 1 (OVERLAPS) 17/242 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 608 unsolved
At refinement iteration 3 (OVERLAPS) 8/250 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 608 unsolved
At refinement iteration 5 (OVERLAPS) 633/883 variables, 250/253 constraints. Problems are: Problem set: 24 solved, 608 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 405/658 constraints. Problems are: Problem set: 24 solved, 608 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 608/1266 constraints. Problems are: Problem set: 24 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 883/883 variables, and 1266 constraints, problems are : Problem set: 24 solved, 608 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 250/250 constraints, ReadFeed: 405/405 constraints, PredecessorRefiner: 608/632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60735ms problems are : Problem set: 24 solved, 608 unsolved
Search for dead transitions found 24 dead transitions in 60739ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 250/420 places, 609/2073 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 226 transition count 597
Applied a total of 36 rules in 8 ms. Remains 226 /250 variables (removed 24) and now considering 597/609 (removed 12) transitions.
// Phase 1: matrix 597 rows 226 cols
[2025-06-04 21:17:22] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:17:22] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-04 21:17:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:17:22] [INFO ] State equation strengthened by 401 read => feed constraints.
[2025-06-04 21:17:24] [INFO ] Implicit Places using invariants and state equation in 2295 ms returned []
Implicit Place search using SMT with State Equation took 2518 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 226/420 places, 597/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67782 ms. Remains : 226/420 places, 597/2073 transitions.
[2025-06-04 21:17:24] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:17:24] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:17:24] [INFO ] Input system was already deterministic with 597 transitions.
[2025-06-04 21:17:24] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:17:24] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:17:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5118166977238444921.gal : 2 ms
[2025-06-04 21:17:24] [INFO ] Time to serialize properties into /tmp/CTLFireability8762817045979988843.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/CTLFireability5118166977238444921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8762817045979988843.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,348128,4.63658,152580,2,8301,5,266319,6,0,1501,177223,0
Converting to forward existential form...Done !
original formula: (AF(EG((((EX(((s1>=1)&&(l3931>=1))) + (s1<1)) + (l3918<1)) * ((AX(((s1<1)||(l3913<1))) + (p671<1)) + (l0<1))))) * (((AX(AX((EG(((s1>=1)&&...456
=> equivalent forward existential formula: ([FwdG(Init,!(EG((((EX(((s1>=1)&&(l3931>=1))) + (s1<1)) + (l3918<1)) * ((!(EX(!(((s1<1)||(l3913<1))))) + (p671<1...753
Reverse transition relation is NOT exact ! Due to transitions t1, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t40, t41, t42, t43, t52,...2367
Using saturation style SCC detection
(forward)formula 0,1,22.0187,600464,1,0,1207,2.56108e+06,1253,547,11155,1.3145e+06,1843
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 420/420 places, 2073/2073 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 368 transition count 660
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 368 transition count 660
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 117 place count 368 transition count 647
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 187 place count 298 transition count 577
Iterating global reduction 1 with 70 rules applied. Total rules applied 257 place count 298 transition count 577
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 310 place count 298 transition count 524
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 422 place count 186 transition count 412
Iterating global reduction 2 with 112 rules applied. Total rules applied 534 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 650 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 652 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 654 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 655 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 656 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 660 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 664 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 676 place count 179 transition count 253
Applied a total of 676 rules in 44 ms. Remains 179 /420 variables (removed 241) and now considering 253/2073 (removed 1820) transitions.
// Phase 1: matrix 253 rows 179 cols
[2025-06-04 21:17:47] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:17:47] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-04 21:17:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:17:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-06-04 21:17:48] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:17:48] [INFO ] Redundant transitions in 4 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-04 21:17:48] [INFO ] Invariant cache hit.
[2025-06-04 21:17:48] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:00] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:00] [INFO ] Deduced a trap composed of 77 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-04 21:18:00] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:00] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:00] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 5/271 constraints. Problems are: Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:05] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:05] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 4 ms to minimize.
Problem TDEAD193 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:05] [INFO ] Deduced a trap composed of 77 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-04 21:18:05] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 5 ms to minimize.
Problem TDEAD194 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:05] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 5 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:06] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 6 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:06] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 9 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:06] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:06] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:06] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:06] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:06] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 12/283 constraints. Problems are: Problem set: 34 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:10] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 18 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 3/286 constraints. Problems are: Problem set: 40 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/432 variables, and 286 constraints, problems are : Problem set: 40 solved, 212 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 1/2 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 38/179 variables, 2/4 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 19/23 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/23 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 253/432 variables, 179/202 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 84/286 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 212/498 constraints. Problems are: Problem set: 40 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:38] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:42] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:43] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 4 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 501 constraints, problems are : Problem set: 46 solved, 206 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 212/252 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60176ms problems are : Problem set: 46 solved, 206 unsolved
Search for dead transitions found 46 dead transitions in 60177ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 179/420 places, 207/2073 transitions.
Graph (complete) has 526 edges and 179 vertex of which 137 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 189
Applied a total of 19 rules in 8 ms. Remains 137 /179 variables (removed 42) and now considering 189/207 (removed 18) transitions.
// Phase 1: matrix 189 rows 137 cols
[2025-06-04 21:18:48] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:18:48] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 21:18:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:18:48] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 21:18:48] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 137/420 places, 189/2073 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 62018 ms. Remains : 137/420 places, 189/2073 transitions.
[2025-06-04 21:18:48] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:18:49] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:18:49] [INFO ] Input system was already deterministic with 189 transitions.
[2025-06-04 21:18:49] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:18:49] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:18:49] [INFO ] Time to serialize gal into /tmp/CTLFireability133801772555901821.gal : 1 ms
[2025-06-04 21:18:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7534086352184832791.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/CTLFireability133801772555901821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7534086352184832791.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,156576,0.783285,35048,2,5800,5,55557,6,0,737,47340,0
Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l3917<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l3917<1)))] != FALSE
Hit Full ! (commute/partial/dont) 9/0/180
(forward)formula 0,1,4.47102,131080,1,0,39,416194,19,4,3823,260085,36
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2073/2073 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 376 transition count 968
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 376 transition count 968
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 125 place count 376 transition count 931
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 187 place count 314 transition count 869
Iterating global reduction 1 with 62 rules applied. Total rules applied 249 place count 314 transition count 869
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 360 place count 314 transition count 758
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 448 place count 226 transition count 670
Iterating global reduction 2 with 88 rules applied. Total rules applied 536 place count 226 transition count 670
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 736 place count 226 transition count 470
Applied a total of 736 rules in 31 ms. Remains 226 /420 variables (removed 194) and now considering 470/2073 (removed 1603) transitions.
// Phase 1: matrix 470 rows 226 cols
[2025-06-04 21:18:53] [INFO ] Computed 3 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:18:53] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-04 21:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:18:53] [INFO ] State equation strengthened by 262 read => feed constraints.
[2025-06-04 21:18:55] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1638 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2025-06-04 21:18:55] [INFO ] Invariant cache hit.
[2025-06-04 21:18:55] [INFO ] State equation strengthened by 262 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 4 (OVERLAPS) 470/696 variables, 226/229 constraints. Problems are: Problem set: 24 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 262/491 constraints. Problems are: Problem set: 24 solved, 445 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:17] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 4 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:18] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 5 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:23] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:23] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:23] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:23] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:23] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:24] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:24] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:24] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:25] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 8 ms to minimize.
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:25] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 6 ms to minimize.
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:25] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 6 ms to minimize.
Problem TDEAD417 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:25] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 10 ms to minimize.
SMT process timed out in 30459ms, After SMT, problems are : Problem set: 42 solved, 427 unsolved
Search for dead transitions found 42 dead transitions in 30460ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LTL mode, iteration 1 : 226/420 places, 428/2073 transitions.
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 188 transition count 412
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 186 transition count 410
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 186 transition count 410
Applied a total of 58 rules in 6 ms. Remains 186 /226 variables (removed 40) and now considering 410/428 (removed 18) transitions.
// Phase 1: matrix 410 rows 186 cols
[2025-06-04 21:19:25] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:19:25] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-04 21:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:19:26] [INFO ] State equation strengthened by 254 read => feed constraints.
[2025-06-04 21:19:27] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/420 places, 410/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34286 ms. Remains : 186/420 places, 410/2073 transitions.
[2025-06-04 21:19:27] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:19:27] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:19:27] [INFO ] Input system was already deterministic with 410 transitions.
[2025-06-04 21:19:27] [INFO ] Flatten gal took : 10 ms
[2025-06-04 21:19:27] [INFO ] Flatten gal took : 9 ms
[2025-06-04 21:19:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14333910288087893467.gal : 1 ms
[2025-06-04 21:19:27] [INFO ] Time to serialize properties into /tmp/CTLFireability7936024136462191092.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/CTLFireability14333910288087893467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7936024136462191092.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,309718,3.22235,104504,2,7133,5,231220,6,0,1154,149894,0
Converting to forward existential form...Done !
original formula: EX(A((((!(AF(((s1>=1)&&(l3922>=1)))) + A(((s1>=1)&&(l3913>=1)) U ((s1>=1)&&(l3914>=1)))) + ((p76>=1)&&(l0>=1))) * (AF(((s1>=1)&&(l3913>=1...354
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(((!(EG(!(!(((s1>=1)&&(l3914>=1)))))) + !(((s5>=1)&&(l0>=1)))) + (((s1>=1)&&(l3916>=1))||(...748
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t20, t21, t22, t27, t28, t29, t30, t31, t37, t38, t39, t40, t41,...1619
(forward)formula 0,0,14.7002,355560,1,0,915,1.69674e+06,877,399,8393,866868,1285
FORMULA RingSingleMessageInMbox-PT-d1m005-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 : 420/420 places, 2073/2073 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 368 transition count 663
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 368 transition count 663
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 120 place count 368 transition count 647
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 190 place count 298 transition count 577
Iterating global reduction 1 with 70 rules applied. Total rules applied 260 place count 298 transition count 577
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 313 place count 298 transition count 524
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 425 place count 186 transition count 412
Iterating global reduction 2 with 112 rules applied. Total rules applied 537 place count 186 transition count 412
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 649 place count 186 transition count 300
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 651 place count 184 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 653 place count 184 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 654 place count 183 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 655 place count 183 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 656 place count 183 transition count 272
Applied a total of 656 rules in 42 ms. Remains 183 /420 variables (removed 237) and now considering 272/2073 (removed 1801) transitions.
// Phase 1: matrix 272 rows 183 cols
[2025-06-04 21:19:42] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:19:42] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-04 21:19:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:19:43] [INFO ] State equation strengthened by 99 read => feed constraints.
[2025-06-04 21:19:43] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-04 21:19:43] [INFO ] Invariant cache hit.
[2025-06-04 21:19:43] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 4 (OVERLAPS) 272/455 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 99/285 constraints. Problems are: Problem set: 24 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:51] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:51] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:51] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:51] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:52] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 6 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:52] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 5 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:53] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:54] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:54] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:54] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:54] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:54] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 15 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:55] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 6 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:55] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:55] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:55] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:55] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:55] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:55] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:56] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 5 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/305 constraints. Problems are: Problem set: 46 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:01] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:01] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:01] [INFO ] Deduced a trap composed of 76 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-04 21:20:02] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 4/309 constraints. Problems are: Problem set: 46 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:06] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:06] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 2/311 constraints. Problems are: Problem set: 46 solved, 225 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/455 variables, and 311 constraints, problems are : Problem set: 46 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 27/167 variables, 2/4 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 11/15 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/15 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 16/183 variables, 1/16 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 13/29 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/29 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 272/455 variables, 183/212 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 99/311 constraints. Problems are: Problem set: 46 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 225/536 constraints. Problems are: Problem set: 46 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 536 constraints, problems are : Problem set: 46 solved, 225 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 225/271 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 46 solved, 225 unsolved
Search for dead transitions found 46 dead transitions in 60227ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 183/420 places, 226/2073 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 141 transition count 208
Applied a total of 60 rules in 2 ms. Remains 141 /183 variables (removed 42) and now considering 208/226 (removed 18) transitions.
// Phase 1: matrix 208 rows 141 cols
[2025-06-04 21:20:44] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:44] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 21:20:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:44] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-04 21:20:45] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/420 places, 208/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62358 ms. Remains : 141/420 places, 208/2073 transitions.
[2025-06-04 21:20:45] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:20:45] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:20:45] [INFO ] Input system was already deterministic with 208 transitions.
[2025-06-04 21:20:45] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:20:45] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:20:45] [INFO ] Time to serialize gal into /tmp/CTLFireability12296273934938317349.gal : 1 ms
[2025-06-04 21:20:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11752822480812195442.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/CTLFireability12296273934938317349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11752822480812195442.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,217078,0.321225,17900,2,4055,5,38698,6,0,772,23510,0
Converting to forward existential form...Done !
original formula: EX(AG(EF(((s1>=1)&&(l3924>=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U ((s1>=1)&&(l3924>=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t36, t37, t38, t41, t50, t53, t59, t64, t75, t76, t77, t78, t79,...686
(forward)formula 0,0,2.11914,74856,1,0,397,260636,437,168,5292,165493,449
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 420/420 places, 2073/2073 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 368 transition count 663
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 368 transition count 663
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 120 place count 368 transition count 647
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 190 place count 298 transition count 577
Iterating global reduction 1 with 70 rules applied. Total rules applied 260 place count 298 transition count 577
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 313 place count 298 transition count 524
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 425 place count 186 transition count 412
Iterating global reduction 2 with 112 rules applied. Total rules applied 537 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 653 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 655 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 657 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 658 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 659 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 663 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 667 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 679 place count 179 transition count 253
Applied a total of 679 rules in 47 ms. Remains 179 /420 variables (removed 241) and now considering 253/2073 (removed 1820) transitions.
// Phase 1: matrix 253 rows 179 cols
[2025-06-04 21:20:47] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:47] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-04 21:20:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:20:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-06-04 21:20:48] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:20:48] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-04 21:20:48] [INFO ] Invariant cache hit.
[2025-06-04 21:20:48] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:01] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:01] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:01] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:01] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:01] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 5/271 constraints. Problems are: Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:06] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:06] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 4 ms to minimize.
Problem TDEAD193 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:06] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:06] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 4 ms to minimize.
Problem TDEAD194 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:06] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 6 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:06] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 5 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:07] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 9 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:07] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:07] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:07] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:07] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:07] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 12/283 constraints. Problems are: Problem set: 34 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:11] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:12] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:12] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 18 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 3/286 constraints. Problems are: Problem set: 40 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/432 variables, and 286 constraints, problems are : Problem set: 40 solved, 212 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 1/2 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 38/179 variables, 2/4 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 19/23 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/23 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 253/432 variables, 179/202 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 84/286 constraints. Problems are: Problem set: 40 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 212/498 constraints. Problems are: Problem set: 40 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:38] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:42] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:21:43] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 3 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 501 constraints, problems are : Problem set: 46 solved, 206 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 212/252 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 46 solved, 206 unsolved
Search for dead transitions found 46 dead transitions in 60170ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 179/420 places, 207/2073 transitions.
Graph (complete) has 526 edges and 179 vertex of which 137 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 189
Applied a total of 19 rules in 5 ms. Remains 137 /179 variables (removed 42) and now considering 189/207 (removed 18) transitions.
// Phase 1: matrix 189 rows 137 cols
[2025-06-04 21:21:48] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:48] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-04 21:21:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:48] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 21:21:49] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 137/420 places, 189/2073 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 62079 ms. Remains : 137/420 places, 189/2073 transitions.
[2025-06-04 21:21:49] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:21:49] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:21:49] [INFO ] Input system was already deterministic with 189 transitions.
[2025-06-04 21:21:49] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:21:49] [INFO ] Flatten gal took : 4 ms
[2025-06-04 21:21:49] [INFO ] Time to serialize gal into /tmp/CTLFireability11751775598919879472.gal : 1 ms
[2025-06-04 21:21:49] [INFO ] Time to serialize properties into /tmp/CTLFireability1712738983685573464.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/CTLFireability11751775598919879472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1712738983685573464.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,156576,0.718217,35812,2,6326,5,57349,6,0,737,51722,0
Converting to forward existential form...Done !
original formula: EG(EF(((s1>=1)&&(l3913>=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((s1>=1)&&(l3913>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t26, t27, t28, t29, t30, t43, t44, t45, t48,...611
(forward)formula 0,0,3.53843,125820,1,0,430,368307,405,187,5092,258039,456
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2073/2073 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 378 transition count 911
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 378 transition count 911
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 102 place count 378 transition count 893
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 136 place count 344 transition count 859
Iterating global reduction 1 with 34 rules applied. Total rules applied 170 place count 344 transition count 859
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 193 place count 344 transition count 836
Discarding 115 places :
Symmetric choice reduction at 2 with 115 rule applications. Total rules 308 place count 229 transition count 721
Iterating global reduction 2 with 115 rules applied. Total rules applied 423 place count 229 transition count 721
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Iterating post reduction 2 with 190 rules applied. Total rules applied 613 place count 229 transition count 531
Applied a total of 613 rules in 25 ms. Remains 229 /420 variables (removed 191) and now considering 531/2073 (removed 1542) transitions.
// Phase 1: matrix 531 rows 229 cols
[2025-06-04 21:21:53] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:53] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-04 21:21:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:21:53] [INFO ] State equation strengthened by 320 read => feed constraints.
[2025-06-04 21:21:54] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
Running 530 sub problems to find dead transitions.
[2025-06-04 21:21:54] [INFO ] Invariant cache hit.
[2025-06-04 21:21:54] [INFO ] State equation strengthened by 320 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
At refinement iteration 4 (OVERLAPS) 531/760 variables, 229/232 constraints. Problems are: Problem set: 24 solved, 506 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/760 variables, 320/552 constraints. Problems are: Problem set: 24 solved, 506 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/760 variables, and 552 constraints, problems are : Problem set: 24 solved, 506 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 229/229 constraints, ReadFeed: 320/320 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 506 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 506 unsolved
At refinement iteration 1 (OVERLAPS) 17/221 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 506 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 506 unsolved
At refinement iteration 3 (OVERLAPS) 8/229 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 506 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 506 unsolved
At refinement iteration 5 (OVERLAPS) 531/760 variables, 229/232 constraints. Problems are: Problem set: 24 solved, 506 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 320/552 constraints. Problems are: Problem set: 24 solved, 506 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 506/1058 constraints. Problems are: Problem set: 24 solved, 506 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/760 variables, and 1058 constraints, problems are : Problem set: 24 solved, 506 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 229/229 constraints, ReadFeed: 320/320 constraints, PredecessorRefiner: 506/530 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60491ms problems are : Problem set: 24 solved, 506 unsolved
Search for dead transitions found 24 dead transitions in 60492ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 229/420 places, 507/2073 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 205 transition count 495
Applied a total of 36 rules in 3 ms. Remains 205 /229 variables (removed 24) and now considering 495/507 (removed 12) transitions.
// Phase 1: matrix 495 rows 205 cols
[2025-06-04 21:22:55] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:22:55] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-04 21:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:22:55] [INFO ] State equation strengthened by 316 read => feed constraints.
[2025-06-04 21:22:59] [INFO ] Implicit Places using invariants and state equation in 3898 ms returned []
Implicit Place search using SMT with State Equation took 4030 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 205/420 places, 495/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66146 ms. Remains : 205/420 places, 495/2073 transitions.
[2025-06-04 21:22:59] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:22:59] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:22:59] [INFO ] Input system was already deterministic with 495 transitions.
[2025-06-04 21:22:59] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:22:59] [INFO ] Flatten gal took : 11 ms
[2025-06-04 21:22:59] [INFO ] Time to serialize gal into /tmp/CTLFireability3485812421291819534.gal : 2 ms
[2025-06-04 21:22:59] [INFO ] Time to serialize properties into /tmp/CTLFireability4328184946478352431.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/CTLFireability3485812421291819534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4328184946478352431.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,450194,4.11297,135280,2,7910,5,259115,6,0,1315,166068,0
Converting to forward existential form...Done !
original formula: A((AG(!((((s1>=1)&&(l3928>=1)) + AG(((s1>=1)&&(l2677>=1)))))) * ((AX(EF(((s1>=1)&&(l3919>=1)))) + AX(AX(((s1>=1)&&(l3926>=1))))) + (EX(!(...350
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(((s1>=1)&&(l3924>=1))))))))) * !(E(!(!(EX(!(((s1>=1)&&(l3924>=1)))))) U (!((!(E(TRUE U !...620
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t32, t33, t34,...1903
Using saturation style SCC detection
(forward)formula 0,0,19.7176,522572,1,0,979,2.18708e+06,1024,431,9683,1.2215e+06,1418
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-10 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 : 420/420 places, 2073/2073 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 374 transition count 913
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 374 transition count 913
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 122 place count 374 transition count 883
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 186 place count 310 transition count 819
Iterating global reduction 1 with 64 rules applied. Total rules applied 250 place count 310 transition count 819
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 352 place count 310 transition count 717
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 444 place count 218 transition count 625
Iterating global reduction 2 with 92 rules applied. Total rules applied 536 place count 218 transition count 625
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 2 with 168 rules applied. Total rules applied 704 place count 218 transition count 457
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 705 place count 217 transition count 444
Iterating global reduction 3 with 1 rules applied. Total rules applied 706 place count 217 transition count 444
Applied a total of 706 rules in 29 ms. Remains 217 /420 variables (removed 203) and now considering 444/2073 (removed 1629) transitions.
// Phase 1: matrix 444 rows 217 cols
[2025-06-04 21:23:19] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:23:19] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-04 21:23:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:23:19] [INFO ] State equation strengthened by 243 read => feed constraints.
[2025-06-04 21:23:20] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2025-06-04 21:23:20] [INFO ] Invariant cache hit.
[2025-06-04 21:23:20] [INFO ] State equation strengthened by 243 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 4 (OVERLAPS) 444/661 variables, 217/220 constraints. Problems are: Problem set: 24 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 243/463 constraints. Problems are: Problem set: 24 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:49] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 4 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:23:49] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 4 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/661 variables, and 465 constraints, problems are : Problem set: 36 solved, 407 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 36 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 17/201 variables, 2/2 constraints. Problems are: Problem set: 36 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/2 constraints. Problems are: Problem set: 36 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 16/217 variables, 1/3 constraints. Problems are: Problem set: 36 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 2/5 constraints. Problems are: Problem set: 36 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/5 constraints. Problems are: Problem set: 36 solved, 407 unsolved
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 6 (OVERLAPS) 444/661 variables, 217/222 constraints. Problems are: Problem set: 44 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 243/465 constraints. Problems are: Problem set: 44 solved, 399 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 399/864 constraints. Problems are: Problem set: 44 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/661 variables, and 864 constraints, problems are : Problem set: 44 solved, 399 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, ReadFeed: 243/243 constraints, PredecessorRefiner: 399/443 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60445ms problems are : Problem set: 44 solved, 399 unsolved
Search for dead transitions found 44 dead transitions in 60446ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in LTL mode, iteration 1 : 217/420 places, 400/2073 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 177 transition count 384
Applied a total of 56 rules in 2 ms. Remains 177 /217 variables (removed 40) and now considering 384/400 (removed 16) transitions.
// Phase 1: matrix 384 rows 177 cols
[2025-06-04 21:24:21] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:21] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 21:24:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:21] [INFO ] State equation strengthened by 235 read => feed constraints.
[2025-06-04 21:24:22] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 177/420 places, 384/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63229 ms. Remains : 177/420 places, 384/2073 transitions.
[2025-06-04 21:24:22] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:24:22] [INFO ] Flatten gal took : 23 ms
[2025-06-04 21:24:22] [INFO ] Input system was already deterministic with 384 transitions.
[2025-06-04 21:24:22] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:24:22] [INFO ] Flatten gal took : 8 ms
[2025-06-04 21:24:22] [INFO ] Time to serialize gal into /tmp/CTLFireability13657732897368238767.gal : 1 ms
[2025-06-04 21:24:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17826345356053056925.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/CTLFireability13657732897368238767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17826345356053056925.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,278959,4.0475,130036,2,6479,5,232620,6,0,1092,141220,0
Converting to forward existential form...Done !
original formula: EF((((E(((s1>=1)&&(l3929>=1)) U !(((s1>=1)&&(l3920>=1)))) * E(AG(((s1>=1)&&(l3921>=1))) U ((s1>=1)&&(l3929>=1)))) * ((s1>=1)&&(l3932>=1))...237
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * ((E(((s1>=1)&&(l3929>=1)) U !(((s1>=1)&&(l3920>=1)))) * E(!(E(TRUE U !(((s1>=1)&&(l392...481
Reverse transition relation is NOT exact ! Due to transitions t1, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t43, t44, t45, t46, t47,...1470
(forward)formula 0,0,8.52573,184276,1,0,590,598583,809,221,7865,362000,825
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2073/2073 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 369 transition count 711
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 369 transition count 711
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 119 place count 369 transition count 694
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 188 place count 300 transition count 625
Iterating global reduction 1 with 69 rules applied. Total rules applied 257 place count 300 transition count 625
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 320 place count 300 transition count 562
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 428 place count 192 transition count 454
Iterating global reduction 2 with 108 rules applied. Total rules applied 536 place count 192 transition count 454
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 664 place count 192 transition count 326
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 666 place count 190 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 668 place count 190 transition count 300
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 669 place count 189 transition count 299
Iterating global reduction 3 with 1 rules applied. Total rules applied 670 place count 189 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 671 place count 189 transition count 298
Applied a total of 671 rules in 27 ms. Remains 189 /420 variables (removed 231) and now considering 298/2073 (removed 1775) transitions.
// Phase 1: matrix 298 rows 189 cols
[2025-06-04 21:24:31] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:31] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-04 21:24:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:24:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-04 21:24:34] [INFO ] Implicit Places using invariants and state equation in 3150 ms returned []
Implicit Place search using SMT with State Equation took 3284 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2025-06-04 21:24:34] [INFO ] Invariant cache hit.
[2025-06-04 21:24:34] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
At refinement iteration 4 (OVERLAPS) 298/487 variables, 189/192 constraints. Problems are: Problem set: 24 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 120/312 constraints. Problems are: Problem set: 24 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:45] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:45] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:45] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:45] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:45] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:45] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:46] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:46] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:46] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 5 ms to minimize.
Problem TDEAD255 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:46] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 5 ms to minimize.
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:46] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:47] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:47] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:47] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:47] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:47] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:47] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:47] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:47] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 4 ms to minimize.
Problem TDEAD241 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 19/331 constraints. Problems are: Problem set: 30 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:55] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 4 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:55] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:55] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 3 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:56] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:56] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:56] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:24:56] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 10 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 7/338 constraints. Problems are: Problem set: 46 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:02] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:02] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:02] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 3/341 constraints. Problems are: Problem set: 46 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 341 constraints, problems are : Problem set: 46 solved, 251 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 3/3 constraints. Problems are: Problem set: 46 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 46 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 1/4 constraints. Problems are: Problem set: 46 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 46 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 42/189 variables, 2/6 constraints. Problems are: Problem set: 46 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 26/32 constraints. Problems are: Problem set: 46 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/32 constraints. Problems are: Problem set: 46 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 298/487 variables, 189/221 constraints. Problems are: Problem set: 46 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 120/341 constraints. Problems are: Problem set: 46 solved, 251 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 251/592 constraints. Problems are: Problem set: 46 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 592 constraints, problems are : Problem set: 46 solved, 251 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 251/297 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60205ms problems are : Problem set: 46 solved, 251 unsolved
Search for dead transitions found 46 dead transitions in 60206ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/420 places, 252/2073 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 147 transition count 234
Applied a total of 60 rules in 2 ms. Remains 147 /189 variables (removed 42) and now considering 234/252 (removed 18) transitions.
// Phase 1: matrix 234 rows 147 cols
[2025-06-04 21:25:34] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:25:34] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-04 21:25:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:25:34] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-04 21:25:35] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/420 places, 234/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64248 ms. Remains : 147/420 places, 234/2073 transitions.
[2025-06-04 21:25:35] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:25:35] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:25:35] [INFO ] Input system was already deterministic with 234 transitions.
[2025-06-04 21:25:35] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:25:35] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:25:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3119864262990855093.gal : 1 ms
[2025-06-04 21:25:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16631727741175152676.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/CTLFireability3119864262990855093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16631727741175152676.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,247338,0.469039,22344,2,4695,5,46730,6,0,822,30441,0
Converting to forward existential form...Done !
original formula: AG(E(((s1>=1)&&(l3924>=1)) U !(AG(AX(((s1>=1)&&(l3936>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((s1>=1)&&(l3924>=1)) U !(!(E(TRUE U !(!(EX(!(((s1>=1)&&(l3936>=1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t40, t41, t42, t45, t54, t57, t63, t68, t79, t80, t81, t82, t87,...803
(forward)formula 0,0,2.88295,95104,1,0,414,349324,494,174,5844,229576,491
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 420/420 places, 2073/2073 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 369 transition count 714
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 369 transition count 714
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 122 place count 369 transition count 694
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 191 place count 300 transition count 625
Iterating global reduction 1 with 69 rules applied. Total rules applied 260 place count 300 transition count 625
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 323 place count 300 transition count 562
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 431 place count 192 transition count 454
Iterating global reduction 2 with 108 rules applied. Total rules applied 539 place count 192 transition count 454
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 675 place count 192 transition count 318
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 677 place count 190 transition count 292
Iterating global reduction 3 with 2 rules applied. Total rules applied 679 place count 190 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 680 place count 189 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 681 place count 189 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 682 place count 189 transition count 290
Applied a total of 682 rules in 42 ms. Remains 189 /420 variables (removed 231) and now considering 290/2073 (removed 1783) transitions.
// Phase 1: matrix 290 rows 189 cols
[2025-06-04 21:25:38] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:25:38] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-04 21:25:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:25:38] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-04 21:25:39] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:25:39] [INFO ] Redundant transitions in 2 ms returned []
Running 289 sub problems to find dead transitions.
[2025-06-04 21:25:39] [INFO ] Invariant cache hit.
[2025-06-04 21:25:39] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 4 (OVERLAPS) 290/479 variables, 189/192 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 112/304 constraints. Problems are: Problem set: 24 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:50] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:50] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:50] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:50] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:50] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 14 ms to minimize.
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:50] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 5 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:51] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 6 ms to minimize.
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:51] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:51] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:51] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:51] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:51] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:51] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:52] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:52] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:25:52] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 5 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 16/320 constraints. Problems are: Problem set: 45 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/320 constraints. Problems are: Problem set: 45 solved, 244 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:04] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:05] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 5 ms to minimize.
Problem TDEAD237 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:05] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:05] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:05] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 10 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/479 variables, 5/325 constraints. Problems are: Problem set: 46 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/479 variables, and 325 constraints, problems are : Problem set: 46 solved, 243 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 46 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 46 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 27/173 variables, 2/3 constraints. Problems are: Problem set: 46 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 9/12 constraints. Problems are: Problem set: 46 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 46 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 16/189 variables, 1/13 constraints. Problems are: Problem set: 46 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 11/24 constraints. Problems are: Problem set: 46 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/24 constraints. Problems are: Problem set: 46 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 290/479 variables, 189/213 constraints. Problems are: Problem set: 46 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 112/325 constraints. Problems are: Problem set: 46 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 243/568 constraints. Problems are: Problem set: 46 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 568 constraints, problems are : Problem set: 46 solved, 243 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 243/289 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 46 solved, 243 unsolved
Search for dead transitions found 46 dead transitions in 60199ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 189/420 places, 244/2073 transitions.
Graph (complete) has 582 edges and 189 vertex of which 147 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 147 transition count 226
Applied a total of 19 rules in 6 ms. Remains 147 /189 variables (removed 42) and now considering 226/244 (removed 18) transitions.
// Phase 1: matrix 226 rows 147 cols
[2025-06-04 21:26:39] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:39] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-04 21:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:40] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-04 21:26:40] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 147/420 places, 226/2073 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 62209 ms. Remains : 147/420 places, 226/2073 transitions.
[2025-06-04 21:26:40] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:26:40] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:26:40] [INFO ] Input system was already deterministic with 226 transitions.
[2025-06-04 21:26:40] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:26:40] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:26:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6266140074907738654.gal : 1 ms
[2025-06-04 21:26:40] [INFO ] Time to serialize properties into /tmp/CTLFireability822524316626775123.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/CTLFireability6266140074907738654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability822524316626775123.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,247338,0.371478,20936,2,4718,5,45486,6,0,814,29377,0
Converting to forward existential form...Done !
original formula: (EG(((s1<1)||(l3922<1))) + E(((s1>=1)&&(l3938>=1)) U ((s1>=1)&&(l3922>=1))))
=> equivalent forward existential formula: ([FwdG(Init,((s1<1)||(l3922<1)))] != FALSE + [(FwdU(Init,((s1>=1)&&(l3938>=1))) * ((s1>=1)&&(l3922>=1)))] != FAL...158
Hit Full ! (commute/partial/dont) 9/0/217
(forward)formula 0,1,3.78586,124096,1,0,39,433295,19,4,4248,288633,36
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-13 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 : 420/420 places, 2073/2073 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 368 transition count 660
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 368 transition count 660
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 117 place count 368 transition count 647
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 187 place count 298 transition count 577
Iterating global reduction 1 with 70 rules applied. Total rules applied 257 place count 298 transition count 577
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 310 place count 298 transition count 524
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 422 place count 186 transition count 412
Iterating global reduction 2 with 112 rules applied. Total rules applied 534 place count 186 transition count 412
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 650 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 652 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 654 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 655 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 656 place count 183 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 657 place count 183 transition count 268
Applied a total of 657 rules in 25 ms. Remains 183 /420 variables (removed 237) and now considering 268/2073 (removed 1805) transitions.
// Phase 1: matrix 268 rows 183 cols
[2025-06-04 21:26:44] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:44] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-04 21:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:26:44] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-06-04 21:26:45] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2025-06-04 21:26:45] [INFO ] Invariant cache hit.
[2025-06-04 21:26:45] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 4 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:52] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 4 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:52] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 4 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:52] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 6 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:53] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 5 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:54] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:54] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:54] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:54] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:54] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:54] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:55] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:55] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:26:55] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 13/294 constraints. Problems are: Problem set: 45 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:02] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:02] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:02] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 3/297 constraints. Problems are: Problem set: 45 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:06] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 5 ms to minimize.
Problem TDEAD215 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 1/298 constraints. Problems are: Problem set: 46 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:12] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:12] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:27:14] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 3/301 constraints. Problems are: Problem set: 46 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/451 variables, and 301 constraints, problems are : Problem set: 46 solved, 221 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 27/167 variables, 2/3 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 7/10 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 16/183 variables, 1/11 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 12/23 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/23 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 268/451 variables, 183/206 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 95/301 constraints. Problems are: Problem set: 46 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 221/522 constraints. Problems are: Problem set: 46 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 522 constraints, problems are : Problem set: 46 solved, 221 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 221/267 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 46 solved, 221 unsolved
Search for dead transitions found 46 dead transitions in 60188ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 183/420 places, 222/2073 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 141 transition count 204
Applied a total of 60 rules in 1 ms. Remains 141 /183 variables (removed 42) and now considering 204/222 (removed 18) transitions.
// Phase 1: matrix 204 rows 141 cols
[2025-06-04 21:27:45] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:27:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 21:27:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:27:45] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-04 21:27:46] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/420 places, 204/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61800 ms. Remains : 141/420 places, 204/2073 transitions.
[2025-06-04 21:27:46] [INFO ] Flatten gal took : 4 ms
[2025-06-04 21:27:46] [INFO ] Flatten gal took : 4 ms
[2025-06-04 21:27:46] [INFO ] Input system was already deterministic with 204 transitions.
[2025-06-04 21:27:46] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:27:46] [INFO ] Flatten gal took : 6 ms
[2025-06-04 21:27:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13301379722699863464.gal : 1 ms
[2025-06-04 21:27:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16333152974944807319.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/CTLFireability13301379722699863464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16333152974944807319.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,217078,0.452116,22364,2,4724,5,46149,6,0,768,29971,0
Converting to forward existential form...Done !
original formula: AF(EX(((s1>=1)&&(l3936>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((s1>=1)&&(l3936>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t36, t37, t38, t41, t50, t53, t59, t64, t71, t72, t73, t74, t79,...662
(forward)formula 0,0,4.46217,145556,1,0,534,473699,430,252,5305,468016,539
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 2073/2073 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 370 transition count 759
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 370 transition count 759
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 118 place count 370 transition count 741
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 186 place count 302 transition count 673
Iterating global reduction 1 with 68 rules applied. Total rules applied 254 place count 302 transition count 673
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 327 place count 302 transition count 600
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 431 place count 198 transition count 496
Iterating global reduction 2 with 104 rules applied. Total rules applied 535 place count 198 transition count 496
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 691 place count 198 transition count 340
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 692 place count 197 transition count 327
Iterating global reduction 3 with 1 rules applied. Total rules applied 693 place count 197 transition count 327
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 694 place count 196 transition count 326
Iterating global reduction 3 with 1 rules applied. Total rules applied 695 place count 196 transition count 326
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 699 place count 192 transition count 322
Iterating global reduction 3 with 4 rules applied. Total rules applied 703 place count 192 transition count 322
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 727 place count 192 transition count 298
Applied a total of 727 rules in 31 ms. Remains 192 /420 variables (removed 228) and now considering 298/2073 (removed 1775) transitions.
// Phase 1: matrix 298 rows 192 cols
[2025-06-04 21:27:50] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:27:50] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-04 21:27:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:27:50] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-04 21:27:53] [INFO ] Implicit Places using invariants and state equation in 2418 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2025-06-04 21:27:53] [INFO ] Invariant cache hit.
[2025-06-04 21:27:53] [INFO ] State equation strengthened by 119 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
At refinement iteration 4 (OVERLAPS) 298/490 variables, 192/195 constraints. Problems are: Problem set: 24 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 119/314 constraints. Problems are: Problem set: 24 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:04] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:04] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 4 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:05] [INFO ] Deduced a trap composed of 83 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-04 21:28:05] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:07] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 9 ms to minimize.
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:08] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 6 ms to minimize.
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:08] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 18 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:08] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:08] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:08] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:08] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:09] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:09] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:28:09] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 5 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 14/328 constraints. Problems are: Problem set: 44 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 328 constraints, problems are : Problem set: 44 solved, 253 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 25/176 variables, 2/3 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 5/8 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 16/192 variables, 1/9 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 8/17 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 298/490 variables, 192/209 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 119/328 constraints. Problems are: Problem set: 44 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 253/581 constraints. Problems are: Problem set: 44 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 581 constraints, problems are : Problem set: 44 solved, 253 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 253/297 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60230ms problems are : Problem set: 44 solved, 253 unsolved
Search for dead transitions found 44 dead transitions in 60231ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in LTL mode, iteration 1 : 192/420 places, 254/2073 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 152 transition count 238
Applied a total of 56 rules in 1 ms. Remains 152 /192 variables (removed 40) and now considering 238/254 (removed 16) transitions.
// Phase 1: matrix 238 rows 152 cols
[2025-06-04 21:28:53] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:28:53] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 21:28:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:28:53] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-04 21:28:54] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/420 places, 238/2073 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63759 ms. Remains : 152/420 places, 238/2073 transitions.
[2025-06-04 21:28:54] [INFO ] Flatten gal took : 7 ms
[2025-06-04 21:28:54] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:28:54] [INFO ] Input system was already deterministic with 238 transitions.
[2025-06-04 21:28:54] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:28:54] [INFO ] Flatten gal took : 5 ms
[2025-06-04 21:28:54] [INFO ] Time to serialize gal into /tmp/CTLFireability175940768716669987.gal : 1 ms
[2025-06-04 21:28:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3153842039273322404.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/CTLFireability175940768716669987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3153842039273322404.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,157580,0.695833,32340,2,5350,5,61812,6,0,846,45515,0
Converting to forward existential form...Done !
original formula: AF((EX(((s1>=1)&&(l3933>=1))) * AG((AF(EX(((s1>=1)&&(l3935>=1)))) * ((s1<1)||(l3937<1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EX(((s1>=1)&&(l3933>=1))) * !(E(TRUE U !((!(EG(!(EX(((s1>=1)&&(l3935>=1)))))) * ((s1<1)||(l3937<1)...172
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t10, t11, t12, t21, t22, t23, t24, t25, t30, t31, t32, t33, t34, t35, t36, t37, t38, ...813
Using saturation style SCC detection
(forward)formula 0,0,7.04878,223360,1,0,533,920135,507,244,6241,624945,618
FORMULA RingSingleMessageInMbox-PT-d1m005-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-04 21:29:01] [INFO ] Flatten gal took : 41 ms
[2025-06-04 21:29:01] [INFO ] Flatten gal took : 41 ms
Total runtime 1151271 ms.
BK_STOP 1749072541689
--------------------
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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="RingSingleMessageInMbox-PT-d1m005"
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 RingSingleMessageInMbox-PT-d1m005, 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 r184-tall-174889264100410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m005.tgz
mv RingSingleMessageInMbox-PT-d1m005 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 '
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 ;