About the Execution of ITS-Tools for DBSingleClientW-PT-d0m07
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 2298442.00 | 0.00 | 0.00 | TFTTTTFTFTTFFFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063400026.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 DBSingleClientW-PT-d0m07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063400026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m07-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748552726068
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 21:05:28] [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-05-29 21:05:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:05:28] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-05-29 21:05:28] [INFO ] Transformed 553 places.
[2025-05-29 21:05:28] [INFO ] Transformed 150 transitions.
[2025-05-29 21:05:29] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 490 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 37 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
Support contains 59 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 98 transition count 134
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 98 transition count 134
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 96 transition count 132
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 96 transition count 132
Applied a total of 30 rules in 59 ms. Remains 96 /109 variables (removed 13) and now considering 132/150 (removed 18) transitions.
// Phase 1: matrix 132 rows 96 cols
[2025-05-29 21:05:29] [INFO ] Computed 2 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:05:29] [INFO ] Implicit Places using invariants in 485 ms returned []
[2025-05-29 21:05:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:05:30] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-29 21:05:30] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-05-29 21:05:30] [INFO ] Invariant cache hit.
[2025-05-29 21:05:30] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/228 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:36] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:36] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:36] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:39] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:42] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:42] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:42] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:42] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:42] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:43] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:05:43] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 169 constraints, problems are : Problem set: 0 solved, 131 unsolved in 21927 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/228 variables, 96/109 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 60/169 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 131/300 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 300 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52355ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 52376ms
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 132/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53402 ms. Remains : 96/109 places, 132/150 transitions.
Support contains 59 out of 96 places after structural reductions.
[2025-05-29 21:06:22] [INFO ] Flatten gal took : 72 ms
[2025-05-29 21:06:22] [INFO ] Flatten gal took : 34 ms
[2025-05-29 21:06:23] [INFO ] Input system was already deterministic with 132 transitions.
Support contains 58 out of 96 places (down from 59) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 52 to 50
RANDOM walk for 40000 steps (9073 resets) in 2669 ms. (14 steps per ms) remains 20/50 properties
BEST_FIRST walk for 4002 steps (407 resets) in 133 ms. (29 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (306 resets) in 96 ms. (41 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (182 resets) in 72 ms. (54 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (426 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (85 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (211 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (196 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (139 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (215 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (397 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (438 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (205 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (206 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (435 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (181 resets) in 26 ms. (148 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (189 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (193 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (393 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (179 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (800 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
[2025-05-29 21:06:24] [INFO ] Invariant cache hit.
[2025-05-29 21:06:24] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/56 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 21/77 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 114/191 variables, 77/79 constraints. Problems are: Problem set: 5 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 42/121 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 37/228 variables, 19/140 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 18/158 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/158 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/158 constraints. Problems are: Problem set: 5 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 158 constraints, problems are : Problem set: 5 solved, 14 unsolved in 1625 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 28/49 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 24/73 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 104/177 variables, 73/75 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 32/107 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 2/109 constraints. Problems are: Problem set: 5 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:26] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:06:26] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 2/111 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/111 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 51/228 variables, 23/134 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 28/162 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 12/174 constraints. Problems are: Problem set: 5 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/174 constraints. Problems are: Problem set: 5 solved, 14 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 0)
(t2 1)
(t3 1)
(t4 3)
(t5 3)
(t6 0)
(t7 0)
(t8 3)
(t9 0)
(t10 0)
(t11 1)
(t12 3)
(t13 1)
(t14 0)
(t15 0)
(t16 3)
(t17 0)
(t18 4)
(t19 1)
(t20 1)
(t21 3)
(t22 1)
(t23 1)
(t24 0)
(t25 2)
(t26 1)
(t27 1)
(t28 2)
(t29 1)
(t30 1)
(t31 0)
(t32 0)
(t33 1)
(t34 0)
(t35 0)
(t36 2)
(t37 0)
(t38 2)
(t39 0)
(t40 2)
(t41 0)
(t42 1)
(t43 0)
(t44 0)
(t45 0)
(t46 0)
(t47 0)
(t48 0)
(t49 2)
(t50 1)
(t51 4)
(t52 0)
(t53 0)
(t54 0)
(t55 4)
(t56 0)
(t57 0)
(t58 1)
(t59 0)
(t60 0)
(t61 0)
(t62 0)
(t63 1)
(t64 1)
(t65 0)
(t66 0)
(t67 0)
(t68 2)
(t69 0)
(t70 0)
(t71 3)
(t72 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 174 constraints, problems are : Problem set: 5 solved, 14 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 14/19 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6674ms problems are : Problem set: 5 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 81 transition count 106
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 81 transition count 106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 76 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 76 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 75 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 75 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 74 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 74 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 73 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 73 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 73 transition count 94
Applied a total of 48 rules in 42 ms. Remains 73 /96 variables (removed 23) and now considering 94/132 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 73/96 places, 94/132 transitions.
RANDOM walk for 40000 steps (9149 resets) in 447 ms. (89 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (4114 resets) in 191 ms. (208 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3125 resets) in 157 ms. (253 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (4053 resets) in 301 ms. (132 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40001 steps (1949 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1994 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4117 resets) in 184 ms. (216 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4082 resets) in 231 ms. (172 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4036 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (2072 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (2002 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4088 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (2011 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 229 ms. (173 steps per ms) remains 12/12 properties
// Phase 1: matrix 94 rows 73 cols
[2025-05-29 21:06:32] [INFO ] Computed 2 invariants in 2 ms
[2025-05-29 21:06:32] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 20/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 20/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 81/139 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 23/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 28/167 variables, 15/98 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 13/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 111 constraints, problems are : Problem set: 0 solved, 12 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 20/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 20/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 81/139 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 23/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 28/167 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/167 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 123 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1790 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2430ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 2 properties in 3981 ms.
Support contains 16 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 94/94 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 90
Applied a total of 4 rules in 10 ms. Remains 71 /73 variables (removed 2) and now considering 90/94 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 71/73 places, 90/94 transitions.
RANDOM walk for 40000 steps (9229 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4026 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (3225 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1985 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (2026 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4168 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4098 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4096 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2113 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (4023 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 2531415 steps, run timeout after 3001 ms. (steps per millisecond=843 ) properties seen :9 out of 10
Probabilistic random walk after 2531415 steps, saw 933854 distinct states, run finished after 3011 ms. (steps per millisecond=840 ) properties seen :9
// Phase 1: matrix 90 rows 71 cols
[2025-05-29 21:06:41] [INFO ] Computed 2 invariants in 3 ms
[2025-05-29 21:06:41] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/116 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/157 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/161 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/161 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/116 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/157 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/161 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/161 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 90/90 transitions.
Graph (complete) has 211 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 64 transition count 78
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 64 transition count 77
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 60 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 60 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 57 transition count 65
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 57 transition count 63
Applied a total of 35 rules in 57 ms. Remains 57 /71 variables (removed 14) and now considering 63/90 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 57/71 places, 63/90 transitions.
RANDOM walk for 40000 steps (9089 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3382 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Probably explored full state space saw : 569970 states, properties seen :0
Probabilistic random walk after 1451868 steps, saw 569970 distinct states, run finished after 1562 ms. (steps per millisecond=929 ) properties seen :0
Explored full state space saw : 570032 states, properties seen :0
Exhaustive walk after 1451951 steps, saw 570032 distinct states, run finished after 1819 ms. (steps per millisecond=798 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2025-05-29 21:06:45] [INFO ] Flatten gal took : 21 ms
[2025-05-29 21:06:45] [INFO ] Flatten gal took : 28 ms
[2025-05-29 21:06:45] [INFO ] Input system was already deterministic with 132 transitions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 319 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 76 transition count 94
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 76 transition count 93
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 69 transition count 86
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 67 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 65 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 64 transition count 74
Applied a total of 69 rules in 72 ms. Remains 64 /96 variables (removed 32) and now considering 74/132 (removed 58) transitions.
// Phase 1: matrix 74 rows 64 cols
[2025-05-29 21:06:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:06:46] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-05-29 21:06:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:06:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 21:06:46] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:06:46] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2025-05-29 21:06:46] [INFO ] Invariant cache hit.
[2025-05-29 21:06:46] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/138 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 89 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/138 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 73/162 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 162 constraints, problems are : Problem set: 0 solved, 73 unsolved in 11044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14000ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 14001ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/96 places, 74/132 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14527 ms. Remains : 64/96 places, 74/132 transitions.
[2025-05-29 21:07:00] [INFO ] Flatten gal took : 12 ms
[2025-05-29 21:07:00] [INFO ] Flatten gal took : 12 ms
[2025-05-29 21:07:00] [INFO ] Input system was already deterministic with 74 transitions.
[2025-05-29 21:07:00] [INFO ] Flatten gal took : 10 ms
[2025-05-29 21:07:00] [INFO ] Flatten gal took : 11 ms
[2025-05-29 21:07:00] [INFO ] Time to serialize gal into /tmp/CTLFireability6867037427490038503.gal : 6 ms
[2025-05-29 21:07:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5470446839541348088.ctl : 10 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/CTLFireability6867037427490038503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5470446839541348088.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,1.1763e+06,1.38774,36692,2,8771,5,118471,6,0,330,127063,0
Converting to forward existential form...Done !
original formula: EF(!(A(!(EF(((s1>=1)&&(l116>=1)))) U !((((p18>=1)&&(l115>=1)) + A(((s1>=1)&&(l345>=1)) U ((s3>=1)&&(l0>=1))))))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(!((((p18>=1)&&(l115>=1)) + !((E(!(((s3>=1)&&(l0>=1))) U (!(((s1>=1)&&(l345>=1))) * !...800
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t20, t29, t47, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t6...311
(forward)formula 0,1,14.6937,336356,1,0,326,1.71487e+06,186,142,2338,1.55382e+06,381
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 78 transition count 98
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 78 transition count 97
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 71 transition count 90
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 71 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 70 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 69 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 69 transition count 85
Applied a total of 57 rules in 10 ms. Remains 69 /96 variables (removed 27) and now considering 85/132 (removed 47) transitions.
// Phase 1: matrix 85 rows 69 cols
[2025-05-29 21:07:15] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:07:15] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-29 21:07:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:07:15] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-29 21:07:15] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-05-29 21:07:15] [INFO ] Invariant cache hit.
[2025-05-29 21:07:15] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/154 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 28/99 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 99 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3996 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/154 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 28/99 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 84/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 183 constraints, problems are : Problem set: 0 solved, 84 unsolved in 12849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16900ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 16901ms
Starting structural reductions in LTL mode, iteration 1 : 69/96 places, 85/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17396 ms. Remains : 69/96 places, 85/132 transitions.
[2025-05-29 21:07:32] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:07:32] [INFO ] Flatten gal took : 14 ms
[2025-05-29 21:07:32] [INFO ] Input system was already deterministic with 85 transitions.
[2025-05-29 21:07:32] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:07:32] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:07:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10802247887089689930.gal : 2 ms
[2025-05-29 21:07:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6335839986433111820.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/CTLFireability10802247887089689930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6335839986433111820.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,2.84964e+06,4.85179,111992,2,13496,5,411274,6,0,361,398141,0
Converting to forward existential form...Done !
original formula: AF((EX((E(((s1>=1)&&(l488>=1)) U ((p21>=1)&&(l126>=1))) + EF(((s1>=1)&&(l133>=1))))) + ((s1>=1)&&(l510>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((EX((E(((s1>=1)&&(l488>=1)) U ((p21>=1)&&(l126>=1))) + E(TRUE U ((s1>=1)&&(l133>=1))))) + ((s1>=1)&...178
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t51, t52, t53, t54, t62, t63, t64, t65, t66, t67, t68, t6...331
(forward)formula 0,1,15.7295,307592,1,0,231,1.63528e+06,203,97,2561,1.2637e+06,263
FORMULA DBSingleClientW-PT-d0m07-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 : 96/96 places, 132/132 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 76 transition count 94
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 76 transition count 93
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 68 transition count 85
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 63 transition count 73
Applied a total of 72 rules in 21 ms. Remains 63 /96 variables (removed 33) and now considering 73/132 (removed 59) transitions.
// Phase 1: matrix 73 rows 63 cols
[2025-05-29 21:07:48] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:07:48] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-29 21:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:07:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 21:07:49] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-05-29 21:07:49] [INFO ] Invariant cache hit.
[2025-05-29 21:07:49] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:50] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:50] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:50] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:50] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:07:50] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 92 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/136 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 22/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 72/164 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 164 constraints, problems are : Problem set: 0 solved, 72 unsolved in 12391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15795ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 15795ms
Starting structural reductions in LTL mode, iteration 1 : 63/96 places, 73/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16075 ms. Remains : 63/96 places, 73/132 transitions.
[2025-05-29 21:08:04] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:08:04] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:08:04] [INFO ] Input system was already deterministic with 73 transitions.
[2025-05-29 21:08:04] [INFO ] Flatten gal took : 9 ms
[2025-05-29 21:08:04] [INFO ] Flatten gal took : 8 ms
[2025-05-29 21:08:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12110953189571080371.gal : 3 ms
[2025-05-29 21:08:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14692797785279510621.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/CTLFireability12110953189571080371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14692797785279510621.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,1.10447e+06,2.66661,59948,2,11130,5,207664,6,0,325,221761,0
Converting to forward existential form...Done !
original formula: AG(AX((EF(((s1>=1)&&(l37>=1))) * ((p34<1)||(l122<1)))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U ((s1>=1)&&(l37>=1)))))] = FALSE * [(EY(FwdU(Init,TRUE)) * !(((p34<1)||(l122<...170
(forward)formula 0,0,2.83011,59948,1,0,9,207664,9,2,636,221761,2
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 76 transition count 94
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 76 transition count 93
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 68 transition count 85
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 68 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 65 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 65 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 63 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 63 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 61 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 61 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 60 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 60 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 60 transition count 66
Applied a total of 80 rules in 20 ms. Remains 60 /96 variables (removed 36) and now considering 66/132 (removed 66) transitions.
// Phase 1: matrix 66 rows 60 cols
[2025-05-29 21:08:07] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:07] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-05-29 21:08:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 21:08:08] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:08:08] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2025-05-29 21:08:08] [INFO ] Invariant cache hit.
[2025-05-29 21:08:08] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/126 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 83 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/126 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 65/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 148 constraints, problems are : Problem set: 0 solved, 65 unsolved in 9100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11393ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 11394ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/96 places, 66/132 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11642 ms. Remains : 60/96 places, 66/132 transitions.
[2025-05-29 21:08:19] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:08:19] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:08:19] [INFO ] Input system was already deterministic with 66 transitions.
[2025-05-29 21:08:19] [INFO ] Flatten gal took : 13 ms
[2025-05-29 21:08:19] [INFO ] Flatten gal took : 13 ms
[2025-05-29 21:08:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6542335986260638425.gal : 2 ms
[2025-05-29 21:08:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12668080878490513371.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6542335986260638425.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12668080878490513371.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 30961 steps (7094 resets) in 171 ms. (180 steps per ms) remains 0/1 properties
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 79 transition count 105
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 79 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 79 transition count 104
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 72 transition count 97
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 72 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 72 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 69 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 69 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 67 transition count 85
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 67 transition count 85
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 65 transition count 83
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 65 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 64 transition count 80
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 64 transition count 79
Applied a total of 71 rules in 8 ms. Remains 64 /96 variables (removed 32) and now considering 79/132 (removed 53) transitions.
// Phase 1: matrix 79 rows 64 cols
[2025-05-29 21:08:19] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:19] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-29 21:08:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:08:19] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-29 21:08:19] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2025-05-29 21:08:19] [INFO ] Invariant cache hit.
[2025-05-29 21:08:19] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/143 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 33/99 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:21] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:23] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:08:23] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 12 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/143 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 102 constraints, problems are : Problem set: 0 solved, 78 unsolved in 6317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 79/143 variables, 64/69 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 33/102 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 78/180 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 180 constraints, problems are : Problem set: 0 solved, 78 unsolved in 12887 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19232ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 19233ms
Starting structural reductions in LTL mode, iteration 1 : 64/96 places, 79/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19527 ms. Remains : 64/96 places, 79/132 transitions.
[2025-05-29 21:08:39] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:08:39] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:08:39] [INFO ] Input system was already deterministic with 79 transitions.
[2025-05-29 21:08:39] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:08:39] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:08:39] [INFO ] Time to serialize gal into /tmp/CTLFireability529418115437207189.gal : 2 ms
[2025-05-29 21:08:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2738136825984907351.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/CTLFireability529418115437207189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2738136825984907351.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,1.53756e+06,2.05878,51500,2,11304,5,206777,6,0,335,169200,0
Converting to forward existential form...Done !
original formula: A(EG(((EF(AG(((s1>=1)&&(l491>=1)))) + AX(((s1>=1)&&(l488>=1)))) + AF(((s1>=1)&&(l150>=1))))) U AX(((EX(AX(((p13>=1)&&(l155>=1)))) * (p24>...172
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(((EX(!(EX(!(((p13>=1)&&(l155>=1)))))) * (p24>=1)) * (l0>=1))))))))) * !(E(!(!(EX(!(((EX(...431
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t47, t48, t49,...374
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,22.6281,494308,1,0,509,2.73527e+06,203,272,2369,2.55875e+06,590
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 79 transition count 98
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 79 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 79 transition count 96
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 73 transition count 90
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 73 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 73 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 72 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 72 transition count 87
Applied a total of 52 rules in 5 ms. Remains 72 /96 variables (removed 24) and now considering 87/132 (removed 45) transitions.
// Phase 1: matrix 87 rows 72 cols
[2025-05-29 21:09:01] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:02] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-05-29 21:09:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:09:02] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-05-29 21:09:02] [INFO ] Invariant cache hit.
[2025-05-29 21:09:02] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/159 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 99 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/159 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 25/99 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 86/185 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 185 constraints, problems are : Problem set: 0 solved, 86 unsolved in 17032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21095ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 21095ms
Starting structural reductions in LTL mode, iteration 1 : 72/96 places, 87/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21591 ms. Remains : 72/96 places, 87/132 transitions.
[2025-05-29 21:09:23] [INFO ] Flatten gal took : 11 ms
[2025-05-29 21:09:23] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:09:23] [INFO ] Input system was already deterministic with 87 transitions.
[2025-05-29 21:09:23] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:09:23] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:09:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3140414239197205260.gal : 1 ms
[2025-05-29 21:09:23] [INFO ] Time to serialize properties into /tmp/CTLFireability13769517377709181858.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/CTLFireability3140414239197205260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13769517377709181858.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,2.88234e+06,4.31864,87612,2,14614,5,263197,6,0,375,361028,0
Converting to forward existential form...Done !
original formula: (AG(((!(E((((p24>=1)&&(l0>=1))||((s1>=1)&&(l487>=1))) U (((s1>=1)&&(l90>=1))&&((s1>=1)&&(l336>=1))))) * EX(A(((p20>=1)&&(l115>=1)) U ((p2...321
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(FALSE)))))),(((p24>=1)&&(l0>=1))||((s1>=1)&&(l487>=1)))) * (((s1>=...544
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t52, t53, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t7...326
(forward)formula 0,1,24.9978,540180,1,0,356,2.62943e+06,229,152,2677,2.58568e+06,438
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 78 transition count 102
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 78 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 78 transition count 101
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 70 transition count 93
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 70 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 67 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 67 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 67 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 65 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 65 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 63 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 63 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 63 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 62 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 62 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 62 transition count 76
Applied a total of 74 rules in 17 ms. Remains 62 /96 variables (removed 34) and now considering 76/132 (removed 56) transitions.
// Phase 1: matrix 76 rows 62 cols
[2025-05-29 21:09:48] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:48] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-29 21:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:09:49] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-29 21:09:49] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:09:49] [INFO ] Redundant transitions in 2 ms returned []
Running 75 sub problems to find dead transitions.
[2025-05-29 21:09:49] [INFO ] Invariant cache hit.
[2025-05-29 21:09:49] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/138 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 28/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 92 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2763 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/138 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 28/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 75/167 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 167 constraints, problems are : Problem set: 0 solved, 75 unsolved in 9276 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12075ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 12076ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/96 places, 76/132 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12488 ms. Remains : 62/96 places, 76/132 transitions.
[2025-05-29 21:10:01] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:10:01] [INFO ] Flatten gal took : 8 ms
[2025-05-29 21:10:01] [INFO ] Input system was already deterministic with 76 transitions.
[2025-05-29 21:10:01] [INFO ] Flatten gal took : 8 ms
[2025-05-29 21:10:01] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:10:01] [INFO ] Time to serialize gal into /tmp/CTLFireability18037694770107878785.gal : 2 ms
[2025-05-29 21:10:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9010264791016594192.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/CTLFireability18037694770107878785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9010264791016594192.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,792055,1.84624,44404,2,9025,5,149565,6,0,324,150778,0
Converting to forward existential form...Done !
original formula: E((A(EG(AF(((s1>=1)&&(l90>=1)))) U AG(((s1>=1)&&(l150>=1)))) + ((p31>=1)&&(l0>=1))) U !(EF(EG(((s1>=1)&&(l354>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,(!((E(!(!(E(TRUE U !(((s1>=1)&&(l150>=1)))))) U (!(EG(!(EG(!(((s1>=1)&&(l90>=1))))))) * !(!(E(TRUE U...307
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t42, t43, t44, t50, t5...356
Using saturation style SCC detection
(forward)formula 0,1,16.8908,375116,1,0,511,1.95765e+06,199,242,2303,1.90011e+06,589
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 77 transition count 97
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 77 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 69 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 69 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 69 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 66 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 66 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 65 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 63 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 63 transition count 74
Applied a total of 71 rules in 23 ms. Remains 63 /96 variables (removed 33) and now considering 74/132 (removed 58) transitions.
// Phase 1: matrix 74 rows 63 cols
[2025-05-29 21:10:18] [INFO ] Computed 2 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:18] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-29 21:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:10:18] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:10:18] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2025-05-29 21:10:18] [INFO ] Invariant cache hit.
[2025-05-29 21:10:18] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:19] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/137 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:21] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/137 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 92 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/137 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 73/165 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 165 constraints, problems are : Problem set: 0 solved, 73 unsolved in 9543 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13982ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 13982ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/96 places, 74/132 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14270 ms. Remains : 63/96 places, 74/132 transitions.
[2025-05-29 21:10:32] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:10:32] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:10:32] [INFO ] Input system was already deterministic with 74 transitions.
[2025-05-29 21:10:32] [INFO ] Flatten gal took : 22 ms
[2025-05-29 21:10:32] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:10:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9054310477216467914.gal : 1 ms
[2025-05-29 21:10:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10115285229120551588.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/CTLFireability9054310477216467914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10115285229120551588.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,1.29705e+06,1.08342,28172,2,7938,5,104686,6,0,326,88666,0
Converting to forward existential form...Done !
original formula: A(EF((EG(((s1>=1)&&(l91>=1))) * (((s1>=1)&&(l340>=1))||(((p30>=1)&&(l0>=1))&&((s1>=1)&&(l32>=1)))))) U ((s1>=1)&&(l488>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((s1>=1)&&(l488>=1)))))) * !(E(!(((s1>=1)&&(l488>=1))) U (!(E(TRUE U (EG(((s1>=1)&&(l91>=1))) *...265
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t45, t46, t47, t48, t53, t54, t55, t56, t57, t58, t59, t60, t61, t6...311
(forward)formula 0,0,10.9583,253832,1,0,326,1.39405e+06,180,138,2269,1.22747e+06,381
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 76 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 76 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 76 transition count 95
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 68 transition count 87
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 60 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 60 transition count 70
Applied a total of 78 rules in 17 ms. Remains 60 /96 variables (removed 36) and now considering 70/132 (removed 62) transitions.
// Phase 1: matrix 70 rows 60 cols
[2025-05-29 21:10:43] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:43] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-05-29 21:10:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:10:43] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 21:10:44] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:10:44] [INFO ] Redundant transitions in 2 ms returned []
Running 69 sub problems to find dead transitions.
[2025-05-29 21:10:44] [INFO ] Invariant cache hit.
[2025-05-29 21:10:44] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:46] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:46] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:46] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:46] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:46] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:46] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:10:47] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 6 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/130 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 92 constraints, problems are : Problem set: 0 solved, 69 unsolved in 5683 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 70/130 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 69/161 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 161 constraints, problems are : Problem set: 0 solved, 69 unsolved in 7957 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13671ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 13672ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/96 places, 70/132 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14023 ms. Remains : 60/96 places, 70/132 transitions.
[2025-05-29 21:10:57] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:10:57] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:10:57] [INFO ] Input system was already deterministic with 70 transitions.
[2025-05-29 21:10:57] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:10:57] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:10:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14167302976042492615.gal : 2 ms
[2025-05-29 21:10:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9983054525732941517.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/CTLFireability14167302976042492615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9983054525732941517.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,748420,0.886659,25468,2,6921,5,84964,6,0,310,80873,0
Converting to forward existential form...Done !
original formula: EG(A(!(EG(AG(((s1>=1)&&(l7>=1))))) U ((s1>=1)&&(l353>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((s1>=1)&&(l353>=1))) U (!(!(EG(!(E(TRUE U !(((s1>=1)&&(l7>=1)))))))) * !(((s1>=1)&&(l353>=1))...201
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t37, t38, t39, t45, t50, t51, t52, t53, t54, t55, t56, t57, t58, t5...306
(forward)formula 0,0,8.88033,199672,1,0,274,1.00264e+06,179,113,2173,937332,317
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 77 transition count 101
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 77 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 77 transition count 100
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 68 transition count 91
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 68 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 68 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 66 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 66 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 65 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 65 transition count 83
Applied a total of 65 rules in 3 ms. Remains 65 /96 variables (removed 31) and now considering 83/132 (removed 49) transitions.
// Phase 1: matrix 83 rows 65 cols
[2025-05-29 21:11:06] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:06] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-29 21:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:06] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-29 21:11:07] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-05-29 21:11:07] [INFO ] Invariant cache hit.
[2025-05-29 21:11:07] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/148 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 98 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3811 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/148 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 82/180 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 180 constraints, problems are : Problem set: 0 solved, 82 unsolved in 8260 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12099ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 12099ms
Starting structural reductions in LTL mode, iteration 1 : 65/96 places, 83/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12352 ms. Remains : 65/96 places, 83/132 transitions.
[2025-05-29 21:11:19] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:11:19] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:11:19] [INFO ] Input system was already deterministic with 83 transitions.
[2025-05-29 21:11:19] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:11:19] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:11:19] [INFO ] Time to serialize gal into /tmp/CTLFireability12830516093663390306.gal : 1 ms
[2025-05-29 21:11:19] [INFO ] Time to serialize properties into /tmp/CTLFireability14555789771232125314.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/CTLFireability12830516093663390306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14555789771232125314.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,1.86934e+06,1.39926,34168,2,8549,5,128019,6,0,343,117250,0
Converting to forward existential form...Done !
original formula: (EF(AX(E(EX(((s1>=1)&&(l340>=1))) U !(EX(((s1>=1)&&(l33>=1))))))) * EF(EG(((AF(((s1<1)||(l91<1))) + ((s1>=1)&&(l150>=1))) * E(((s1>=1)&&(...192
=> equivalent forward existential formula: [FwdG(FwdU((Init * E(TRUE U !(EX(!(E(EX(((s1>=1)&&(l340>=1))) U !(EX(((s1>=1)&&(l33>=1)))))))))),TRUE),((!(EG(!(...260
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t51, t52, t53,...364
(forward)formula 0,0,7.38892,173628,1,0,273,787033,209,115,2418,821675,315
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-09 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 : 96/96 places, 132/132 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 77 transition count 101
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 77 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 77 transition count 100
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 70 transition count 93
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 70 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 70 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 69 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 69 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 69 transition count 88
Applied a total of 58 rules in 10 ms. Remains 69 /96 variables (removed 27) and now considering 88/132 (removed 44) transitions.
// Phase 1: matrix 88 rows 69 cols
[2025-05-29 21:11:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:26] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-29 21:11:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-29 21:11:27] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:11:27] [INFO ] Redundant transitions in 3 ms returned []
Running 87 sub problems to find dead transitions.
[2025-05-29 21:11:27] [INFO ] Invariant cache hit.
[2025-05-29 21:11:27] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/157 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 32/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/157 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 103 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2791 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/157 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 32/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 87/190 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 190 constraints, problems are : Problem set: 0 solved, 87 unsolved in 16243 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19077ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 19077ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/96 places, 88/132 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19470 ms. Remains : 69/96 places, 88/132 transitions.
[2025-05-29 21:11:46] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:11:46] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:11:46] [INFO ] Input system was already deterministic with 88 transitions.
[2025-05-29 21:11:46] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:11:46] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:11:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13200127152120739507.gal : 1 ms
[2025-05-29 21:11:46] [INFO ] Time to serialize properties into /tmp/CTLFireability7500358906569221753.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/CTLFireability13200127152120739507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7500358906569221753.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,3.39273e+06,4.31205,81896,2,11197,5,301122,6,0,364,329680,0
Converting to forward existential form...Done !
original formula: EG((AF(((s1<1)||(l510<1))) * EG(!(A((((s1>=1)&&(l491>=1))||((s1>=1)&&(l501>=1))) U EG(((s1>=1)&&(l149>=1))))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(((s1<1)||(l510<1))))) * EG(!(!((E(!(EG(((s1>=1)&&(l149>=1)))) U (!((((s1>=1)&&(l491>=1))||((s...256
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t53, t55, t56, t57, t5...366
(forward)formula 0,1,25.2319,447080,1,0,364,2.26363e+06,214,156,2648,2.21414e+06,416
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-10 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 : 96/96 places, 132/132 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 76 transition count 94
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 76 transition count 93
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 67 transition count 84
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 67 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 64 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 64 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 62 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 60 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 60 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 59 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 59 transition count 66
Applied a total of 81 rules in 5 ms. Remains 59 /96 variables (removed 37) and now considering 66/132 (removed 66) transitions.
// Phase 1: matrix 66 rows 59 cols
[2025-05-29 21:12:11] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-29 21:12:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 21:12:11] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2025-05-29 21:12:11] [INFO ] Invariant cache hit.
[2025-05-29 21:12:11] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 8997 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10738ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 10739ms
Starting structural reductions in LTL mode, iteration 1 : 59/96 places, 66/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11019 ms. Remains : 59/96 places, 66/132 transitions.
[2025-05-29 21:12:22] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:12:22] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:12:22] [INFO ] Input system was already deterministic with 66 transitions.
[2025-05-29 21:12:22] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:12:22] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:12:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9229672836745190277.gal : 1 ms
[2025-05-29 21:12:22] [INFO ] Time to serialize properties into /tmp/CTLFireability7800532150064867219.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/CTLFireability9229672836745190277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7800532150064867219.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,577322,1.54949,35628,2,8483,5,130360,6,0,302,114889,0
Converting to forward existential form...Done !
original formula: EG(EX(((p33<1)||(l0<1))))
=> equivalent forward existential formula: [FwdG(Init,EX(((p33<1)||(l0<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...291
(forward)formula 0,1,9.20875,184420,1,0,358,800687,154,202,2079,1.02819e+06,297
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2025-11 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 : 96/96 places, 132/132 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 78 transition count 98
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 78 transition count 97
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 71 transition count 90
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 71 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 71 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 70 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 70 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 70 transition count 86
Applied a total of 55 rules in 4 ms. Remains 70 /96 variables (removed 26) and now considering 86/132 (removed 46) transitions.
// Phase 1: matrix 86 rows 70 cols
[2025-05-29 21:12:31] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:32] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-29 21:12:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 21:12:32] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-05-29 21:12:32] [INFO ] Invariant cache hit.
[2025-05-29 21:12:32] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/156 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 98 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3890 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/156 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 85/183 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 183 constraints, problems are : Problem set: 0 solved, 85 unsolved in 15624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19544ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 19545ms
Starting structural reductions in LTL mode, iteration 1 : 70/96 places, 86/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19784 ms. Remains : 70/96 places, 86/132 transitions.
[2025-05-29 21:12:51] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:12:51] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:12:51] [INFO ] Input system was already deterministic with 86 transitions.
[2025-05-29 21:12:51] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:12:51] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5009942785106371896.gal : 1 ms
[2025-05-29 21:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8747068191678570515.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/CTLFireability5009942785106371896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8747068191678570515.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,2.76678e+06,3.22184,76664,2,10874,5,261737,6,0,366,301993,0
Converting to forward existential form...Done !
original formula: E(EX(!(EX(((!((s1>=1)&&(l504>=1)))&&(((p24>=1)&&(l0>=1))||((p33>=1)&&(l0>=1))))))) U ((p37>=1)&&(l122>=1)))
=> equivalent forward existential formula: [(FwdU(Init,EX(!(EX(((!((s1>=1)&&(l504>=1)))&&(((p24>=1)&&(l0>=1))||((p33>=1)&&(l0>=1)))))))) * ((p37>=1)&&(l122...171
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t49, t52, t53, t54, t61, t62, t63, t64, t65, t66, t67, t68, t69, t7...331
(forward)formula 0,1,16.423,324092,1,0,395,1.33351e+06,193,221,2531,1.85976e+06,415
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 78 transition count 103
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 78 transition count 103
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 70 transition count 95
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 70 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 70 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 68 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 68 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 66 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 66 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 65 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 65 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 65 transition count 83
Applied a total of 66 rules in 5 ms. Remains 65 /96 variables (removed 31) and now considering 83/132 (removed 49) transitions.
// Phase 1: matrix 83 rows 65 cols
[2025-05-29 21:13:08] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:08] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-29 21:13:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:08] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-29 21:13:08] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-05-29 21:13:08] [INFO ] Invariant cache hit.
[2025-05-29 21:13:08] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/148 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:13:10] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:13:10] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:13:12] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:13:12] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:13:13] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:13:14] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:13:15] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 0/148 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 108 constraints, problems are : Problem set: 0 solved, 82 unsolved in 10003 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 83/148 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 34/108 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 82/190 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 190 constraints, problems are : Problem set: 0 solved, 82 unsolved in 9011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19054ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 19055ms
Starting structural reductions in LTL mode, iteration 1 : 65/96 places, 83/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19288 ms. Remains : 65/96 places, 83/132 transitions.
[2025-05-29 21:13:27] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:13:27] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:13:27] [INFO ] Input system was already deterministic with 83 transitions.
[2025-05-29 21:13:27] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:13:27] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:13:27] [INFO ] Time to serialize gal into /tmp/CTLFireability10588273642997755151.gal : 1 ms
[2025-05-29 21:13:27] [INFO ] Time to serialize properties into /tmp/CTLFireability16309533092507437424.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/CTLFireability10588273642997755151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16309533092507437424.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,1.77502e+06,2.3395,54176,2,9820,5,199242,6,0,343,193004,0
Converting to forward existential form...Done !
original formula: EG(((EF(((s1<1)||(l355<1))) * EX(((E(!(((s1<1)||(l355<1))) U ((s2>=1)&&(l497>=1))) + AF(((s4>=1)&&(l0>=1)))) + (((s1>=1)&&(l491>=1))||((s...278
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U ((s1<1)||(l355<1))) * EX(((E(!(((s1<1)||(l355<1))) U ((s2>=1)&&(l497>=1))) + !(EG(!(((s4>=...408
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t52, t54, t55, t56, t6...356
(forward)formula 0,0,21.3621,425544,1,0,404,2.2986e+06,216,173,2423,2.08922e+06,490
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2023-13 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 : 96/96 places, 132/132 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 77 transition count 97
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 77 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 69 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 69 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 66 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 64 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 62 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 61 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 61 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 61 transition count 69
Applied a total of 78 rules in 17 ms. Remains 61 /96 variables (removed 35) and now considering 69/132 (removed 63) transitions.
// Phase 1: matrix 69 rows 61 cols
[2025-05-29 21:13:49] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:49] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-29 21:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:13:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:13:49] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:13:49] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2025-05-29 21:13:49] [INFO ] Invariant cache hit.
[2025-05-29 21:13:49] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/130 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 88 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/130 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 68/156 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 156 constraints, problems are : Problem set: 0 solved, 68 unsolved in 7584 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10137ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 10138ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/96 places, 69/132 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10394 ms. Remains : 61/96 places, 69/132 transitions.
[2025-05-29 21:13:59] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:13:59] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:13:59] [INFO ] Input system was already deterministic with 69 transitions.
[2025-05-29 21:13:59] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:13:59] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:13:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14212063988410751718.gal : 1 ms
[2025-05-29 21:13:59] [INFO ] Time to serialize properties into /tmp/CTLFireability154174777560850261.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/CTLFireability14212063988410751718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability154174777560850261.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,924721,1.33847,31868,2,9259,5,105352,6,0,313,118404,0
Converting to forward existential form...Done !
original formula: AG(AF((EG(AF(((s1<1)||(l488<1)))) + EG(((s1>=1)&&(l37>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EG(!(EG(!(((s1<1)||(l488<1)))))) + EG(((s1>=1)&&(l37>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t29, t42, t43, t44, t45, t50, t51, t52, t53, t54, t55, t56, t5...311
(forward)formula 0,1,12.2859,277708,1,0,333,1.3956e+06,176,139,2174,1.48019e+06,377
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2023-14 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 : 96/96 places, 132/132 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 79 transition count 105
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 79 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 79 transition count 104
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 72 transition count 97
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 72 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 70 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 70 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 70 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 69 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 68 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 68 transition count 87
Applied a total of 60 rules in 5 ms. Remains 68 /96 variables (removed 28) and now considering 87/132 (removed 45) transitions.
// Phase 1: matrix 87 rows 68 cols
[2025-05-29 21:14:12] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:14:12] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-05-29 21:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:14:12] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-29 21:14:12] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-05-29 21:14:12] [INFO ] Invariant cache hit.
[2025-05-29 21:14:12] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/155 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 33/103 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:14] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:15] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:15] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:15] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:15] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:14:16] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 109 constraints, problems are : Problem set: 0 solved, 86 unsolved in 7164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/155 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 86/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/155 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 195 constraints, problems are : Problem set: 0 solved, 86 unsolved in 17287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24494ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 24495ms
Starting structural reductions in LTL mode, iteration 1 : 68/96 places, 87/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24792 ms. Remains : 68/96 places, 87/132 transitions.
[2025-05-29 21:14:36] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:14:36] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:14:36] [INFO ] Input system was already deterministic with 87 transitions.
[2025-05-29 21:14:36] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:14:36] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:14:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7314652218345267216.gal : 2 ms
[2025-05-29 21:14:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1827374152341943671.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/CTLFireability7314652218345267216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1827374152341943671.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,2.21487e+06,2.28288,51396,2,9322,5,181790,6,0,359,189623,0
Converting to forward existential form...Done !
original formula: E((E(((s1>=1)&&(l345>=1)) U A(EF(((s1>=1)&&(l345>=1))) U (((s1>=1)&&(l353>=1))||((p24>=1)&&(l0>=1))))) + !(A((((s1>=1)&&(l149>=1))||((s1>...250
=> equivalent forward existential formula: [(FwdU(Init,(E(((s1>=1)&&(l345>=1)) U !((E(!((((s1>=1)&&(l353>=1))||((p24>=1)&&(l0>=1)))) U (!(E(TRUE U ((s1>=1)...544
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t47, t48, t49, t55, t5...381
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-29 21:15:06] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:15:06] [INFO ] Applying decomposition
[2025-05-29 21:15:06] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11593225871318019987.txt' '-o' '/tmp/graph11593225871318019987.bin' '-w' '/tmp/graph11593225871318019987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11593225871318019987.bin' '-l' '-1' '-v' '-w' '/tmp/graph11593225871318019987.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:15:07] [INFO ] Decomposing Gal with order
[2025-05-29 21:15:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:15:07] [INFO ] Removed a total of 84 redundant transitions.
[2025-05-29 21:15:07] [INFO ] Flatten gal took : 61 ms
[2025-05-29 21:15:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 11 ms.
[2025-05-29 21:15:07] [INFO ] Time to serialize gal into /tmp/CTLFireability7180981504943693346.gal : 3 ms
[2025-05-29 21:15:07] [INFO ] Time to serialize properties into /tmp/CTLFireability15890638147576293121.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/CTLFireability7180981504943693346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15890638147576293121.ctl'
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 -...263
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,2.21487e+06,4.01109,72180,1852,507,67840,5820,268,431925,86,57718,0
Converting to forward existential form...Done !
original formula: E((E(((i1.u2.s1>=1)&&(i0.u0.l345>=1)) U A(EF(((i1.u2.s1>=1)&&(i0.u0.l345>=1))) U (((i1.u2.s1>=1)&&(i0.u0.l353>=1))||((i1.u8.p24>=1)&&(i1....353
=> equivalent forward existential formula: [(FwdU(Init,(E(((i1.u2.s1>=1)&&(i0.u0.l345>=1)) U !((E(!((((i1.u2.s1>=1)&&(i0.u0.l353>=1))||((i1.u8.p24>=1)&&(i1...737
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t30, t44, t47, t48, t49, t58, t59, t60, t64, t65, t67, t68, t69, t70, t71, t72, t...333
Detected timeout of ITS tools.
[2025-05-29 21:15:37] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:15:37] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:15:37] [INFO ] Applying decomposition
[2025-05-29 21:15:37] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3087034692920269932.txt' '-o' '/tmp/graph3087034692920269932.bin' '-w' '/tmp/graph3087034692920269932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3087034692920269932.bin' '-l' '-1' '-v' '-w' '/tmp/graph3087034692920269932.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:15:37] [INFO ] Decomposing Gal with order
[2025-05-29 21:15:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:15:37] [INFO ] Removed a total of 149 redundant transitions.
[2025-05-29 21:15:37] [INFO ] Flatten gal took : 24 ms
[2025-05-29 21:15:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 10 ms.
[2025-05-29 21:15:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1726311369913963646.gal : 3 ms
[2025-05-29 21:15:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17695829720886416255.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/CTLFireability1726311369913963646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17695829720886416255.ctl'
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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.75723e+07,98.9226,1293308,7183,822,1.18662e+06,55272,386,1.0408e+07,109,422272,0
Converting to forward existential form...Done !
original formula: E((E(((i3.i0.u0.s1>=1)&&(i3.i0.u1.l345>=1)) U A(EF(((i3.i0.u0.s1>=1)&&(i3.i0.u1.l345>=1))) U (((i3.i0.u0.s1>=1)&&(i3.i1.u12.l353>=1))||((...396
=> equivalent forward existential formula: [(FwdU(Init,(E(((i3.i0.u0.s1>=1)&&(i3.i0.u1.l345>=1)) U !((E(!((((i3.i0.u0.s1>=1)&&(i3.i1.u12.l353>=1))||((i2.u8...824
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t26, t33, t72, t74, t83, t85, t87, t89, t97, t99, t101, t102, t103, t104, t105, t106,...480
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
[2025-05-29 21:38:59] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:38:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14710885688992476596.gal : 1 ms
[2025-05-29 21:38:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5776086319275055766.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/CTLFireability14710885688992476596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5776086319275055766.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,1.75723e+07,46.4268,862492,2,48074,5,3.0581e+06,6,0,516,2.23629e+06,0
Converting to forward existential form...Done !
original formula: E((E(((s1>=1)&&(l345>=1)) U A(EF(((s1>=1)&&(l345>=1))) U (((s1>=1)&&(l353>=1))||((p24>=1)&&(l0>=1))))) + !(A((((s1>=1)&&(l149>=1))||((s1>...250
=> equivalent forward existential formula: [(FwdU(Init,(E(((s1>=1)&&(l345>=1)) U !((E(!((((s1>=1)&&(l353>=1))||((p24>=1)&&(l0>=1)))) U (!(E(TRUE U ((s1>=1)...544
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t19, t21, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35,...562
Using saturation style SCC detection
(forward)formula 0,1,283.25,2468008,1,0,527,1.23111e+07,13,224,1607,1.13911e+07,133
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2295999 ms.
BK_STOP 1748555024510
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m07"
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 DBSingleClientW-PT-d0m07, 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 r058-smll-174854063400026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m07.tgz
mv DBSingleClientW-PT-d0m07 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 ;