Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063500114.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-d2m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063500114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 1.6M 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-d2m04-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d2m04-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748604355914

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-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 11:25:58] [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-30 11:25:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:25:59] [INFO ] Load time of PNML (sax parser for PT used): 599 ms
[2025-05-30 11:25:59] [INFO ] Transformed 4763 places.
[2025-05-30 11:25:59] [INFO ] Transformed 2478 transitions.
[2025-05-30 11:25:59] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 862 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Deduced a syphon composed of 3580 places in 36 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 80 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 356 places :
Symmetric choice reduction at 1 with 356 rule applications. Total rules 601 place count 781 transition count 1542
Iterating global reduction 1 with 356 rules applied. Total rules applied 957 place count 781 transition count 1542
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 1038 place count 781 transition count 1461
Discarding 278 places :
Symmetric choice reduction at 2 with 278 rule applications. Total rules 1316 place count 503 transition count 1183
Iterating global reduction 2 with 278 rules applied. Total rules applied 1594 place count 503 transition count 1183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1602 place count 503 transition count 1175
Discarding 191 places :
Symmetric choice reduction at 3 with 191 rule applications. Total rules 1793 place count 312 transition count 913
Iterating global reduction 3 with 191 rules applied. Total rules applied 1984 place count 312 transition count 913
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Iterating post reduction 3 with 246 rules applied. Total rules applied 2230 place count 312 transition count 667
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2241 place count 301 transition count 649
Iterating global reduction 4 with 11 rules applied. Total rules applied 2252 place count 301 transition count 649
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 2279 place count 301 transition count 622
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 2284 place count 296 transition count 617
Iterating global reduction 5 with 5 rules applied. Total rules applied 2289 place count 296 transition count 617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2290 place count 296 transition count 616
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2294 place count 292 transition count 612
Iterating global reduction 6 with 4 rules applied. Total rules applied 2298 place count 292 transition count 612
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2302 place count 292 transition count 608
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2303 place count 291 transition count 606
Iterating global reduction 7 with 1 rules applied. Total rules applied 2304 place count 291 transition count 606
Applied a total of 2304 rules in 477 ms. Remains 291 /1183 variables (removed 892) and now considering 606/2478 (removed 1872) transitions.
// Phase 1: matrix 606 rows 291 cols
[2025-05-30 11:26:00] [INFO ] Computed 2 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:26:01] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2025-05-30 11:26:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:26:02] [INFO ] State equation strengthened by 327 read => feed constraints.
[2025-05-30 11:26:04] [INFO ] Implicit Places using invariants and state equation in 3310 ms returned []
Implicit Place search using SMT with State Equation took 4713 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2025-05-30 11:26:04] [INFO ] Invariant cache hit.
[2025-05-30 11:26:04] [INFO ] State equation strengthened by 327 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/897 variables, and 2 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/291 constraints, ReadFeed: 0/327 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (OVERLAPS) 606/897 variables, 291/293 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 327/620 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/897 variables, and 1225 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 291/291 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62590ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 62618ms
Starting structural reductions in LTL mode, iteration 1 : 291/1183 places, 606/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67844 ms. Remains : 291/1183 places, 606/2478 transitions.
Support contains 80 out of 291 places after structural reductions.
[2025-05-30 11:27:07] [INFO ] Flatten gal took : 145 ms
[2025-05-30 11:27:07] [INFO ] Flatten gal took : 88 ms
[2025-05-30 11:27:08] [INFO ] Input system was already deterministic with 606 transitions.
Support contains 79 out of 291 places (down from 80) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 60 to 59
RANDOM walk for 40000 steps (9084 resets) in 4156 ms. (9 steps per ms) remains 56/59 properties
BEST_FIRST walk for 4002 steps (196 resets) in 45 ms. (87 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (170 resets) in 46 ms. (85 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (170 resets) in 59 ms. (66 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (365 resets) in 124 ms. (32 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (163 resets) in 72 ms. (54 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (170 resets) in 57 ms. (69 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (176 resets) in 40 ms. (97 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (402 resets) in 64 ms. (61 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (174 resets) in 41 ms. (95 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (196 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (181 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (175 resets) in 27 ms. (143 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (177 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (355 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (198 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (195 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (156 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (173 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (174 resets) in 38 ms. (102 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (167 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (201 resets) in 37 ms. (105 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (170 resets) in 39 ms. (100 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (158 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (167 resets) in 38 ms. (102 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (167 resets) in 41 ms. (95 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (386 resets) in 60 ms. (65 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (168 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (192 resets) in 39 ms. (100 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (187 resets) in 41 ms. (95 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (182 resets) in 35 ms. (111 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (179 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (186 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (163 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (162 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (196 resets) in 40 ms. (97 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (365 resets) in 47 ms. (83 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (182 resets) in 35 ms. (111 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (180 resets) in 70 ms. (56 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (175 resets) in 36 ms. (108 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (165 resets) in 32 ms. (121 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (180 resets) in 25 ms. (153 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (362 resets) in 39 ms. (100 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (180 resets) in 32 ms. (121 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (197 resets) in 35 ms. (111 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (177 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (374 resets) in 40 ms. (97 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (170 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (378 resets) in 50 ms. (78 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (167 resets) in 46 ms. (85 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (378 resets) in 66 ms. (59 steps per ms) remains 56/56 properties
Interrupted probabilistic random walk after 198295 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :41 out of 56
Probabilistic random walk after 198295 steps, saw 78507 distinct states, run finished after 3008 ms. (steps per millisecond=65 ) properties seen :41
[2025-05-30 11:27:13] [INFO ] Invariant cache hit.
[2025-05-30 11:27:13] [INFO ] State equation strengthened by 327 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 102/127 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 64/191 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:13] [INFO ] Deduced a trap composed of 86 places in 192 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:14] [INFO ] Deduced a trap composed of 95 places in 172 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:14] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:14] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:14] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 5/7 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 405/596 variables, 191/198 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/596 variables, 126/324 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/596 variables, 0/324 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp52 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 293/889 variables, 96/420 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/889 variables, 197/617 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/889 variables, 0/617 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 8/897 variables, 4/621 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/897 variables, and 625 constraints, problems are : Problem set: 5 solved, 10 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 291/291 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 104/118 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 66/184 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 5/7 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:18] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:18] [INFO ] Deduced a trap composed of 89 places in 222 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:19] [INFO ] Deduced a trap composed of 87 places in 242 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:19] [INFO ] Deduced a trap composed of 89 places in 191 ms of which 31 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 4/11 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 346/530 variables, 184/195 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 67/262 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/263 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/263 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 345/875 variables, 96/359 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/875 variables, 249/608 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/875 variables, 9/617 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 875/897 variables, and 617 constraints, problems are : Problem set: 5 solved, 10 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/291 constraints, ReadFeed: 316/327 constraints, PredecessorRefiner: 10/15 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10095ms problems are : Problem set: 5 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 606/606 transitions.
Graph (complete) has 1099 edges and 291 vertex of which 290 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 290 transition count 600
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 57 place count 240 transition count 421
Iterating global reduction 1 with 50 rules applied. Total rules applied 107 place count 240 transition count 421
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 118 place count 240 transition count 410
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 156 place count 202 transition count 366
Iterating global reduction 2 with 38 rules applied. Total rules applied 194 place count 202 transition count 366
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 208 place count 202 transition count 352
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 237 place count 173 transition count 304
Iterating global reduction 3 with 29 rules applied. Total rules applied 266 place count 173 transition count 304
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 285 place count 173 transition count 285
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 298 place count 160 transition count 262
Iterating global reduction 4 with 13 rules applied. Total rules applied 311 place count 160 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 314 place count 160 transition count 259
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 322 place count 152 transition count 251
Iterating global reduction 5 with 8 rules applied. Total rules applied 330 place count 152 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 334 place count 152 transition count 247
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 337 place count 149 transition count 244
Iterating global reduction 6 with 3 rules applied. Total rules applied 340 place count 149 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 343 place count 149 transition count 241
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 345 place count 147 transition count 228
Iterating global reduction 7 with 2 rules applied. Total rules applied 347 place count 147 transition count 228
Applied a total of 347 rules in 104 ms. Remains 147 /291 variables (removed 144) and now considering 228/606 (removed 378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 147/291 places, 228/606 transitions.
RANDOM walk for 40000 steps (9220 resets) in 838 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1747 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3769 resets) in 509 ms. (78 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1791 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1702 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1816 resets) in 108 ms. (366 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1813 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1736 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1863 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3858 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3813 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
Probably explored full state space saw : 32337 states, properties seen :9
Probabilistic random walk after 79828 steps, saw 32337 distinct states, run finished after 463 ms. (steps per millisecond=172 ) properties seen :9
Explored full state space saw : 32428 states, properties seen :0
Exhaustive walk after 79996 steps, saw 32428 distinct states, run finished after 138 ms. (steps per millisecond=579 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:27:24] [INFO ] Flatten gal took : 39 ms
[2025-05-30 11:27:25] [INFO ] Flatten gal took : 41 ms
[2025-05-30 11:27:25] [INFO ] Input system was already deterministic with 606 transitions.
Support contains 63 out of 291 places (down from 69) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 37 stable transitions
Graph (complete) has 1188 edges and 291 vertex of which 290 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 235 transition count 430
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 235 transition count 430
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 127 place count 235 transition count 415
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 170 place count 192 transition count 362
Iterating global reduction 1 with 43 rules applied. Total rules applied 213 place count 192 transition count 362
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 229 place count 192 transition count 346
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 261 place count 160 transition count 295
Iterating global reduction 2 with 32 rules applied. Total rules applied 293 place count 160 transition count 295
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 314 place count 160 transition count 274
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 330 place count 144 transition count 232
Iterating global reduction 3 with 16 rules applied. Total rules applied 346 place count 144 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 349 place count 144 transition count 229
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 359 place count 134 transition count 219
Iterating global reduction 4 with 10 rules applied. Total rules applied 369 place count 134 transition count 219
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 373 place count 134 transition count 215
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 378 place count 129 transition count 209
Iterating global reduction 5 with 5 rules applied. Total rules applied 383 place count 129 transition count 209
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 388 place count 129 transition count 204
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 391 place count 126 transition count 184
Iterating global reduction 6 with 3 rules applied. Total rules applied 394 place count 126 transition count 184
Applied a total of 394 rules in 32 ms. Remains 126 /291 variables (removed 165) and now considering 184/606 (removed 422) transitions.
// Phase 1: matrix 184 rows 126 cols
[2025-05-30 11:27:25] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:27:25] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-30 11:27:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:27:25] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-30 11:27:25] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2025-05-30 11:27:25] [INFO ] Invariant cache hit.
[2025-05-30 11:27:25] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/310 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 65/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:39] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:39] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 25 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/310 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:27:42] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 25 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 196 constraints, problems are : Problem set: 0 solved, 183 unsolved in 29158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/310 variables, 126/131 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 65/196 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 183/379 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 379 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59322ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 59323ms
Starting structural reductions in LTL mode, iteration 1 : 126/291 places, 184/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59985 ms. Remains : 126/291 places, 184/606 transitions.
[2025-05-30 11:28:25] [INFO ] Flatten gal took : 17 ms
[2025-05-30 11:28:25] [INFO ] Flatten gal took : 17 ms
[2025-05-30 11:28:25] [INFO ] Input system was already deterministic with 184 transitions.
[2025-05-30 11:28:25] [INFO ] Flatten gal took : 17 ms
[2025-05-30 11:28:25] [INFO ] Flatten gal took : 15 ms
[2025-05-30 11:28:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8129854549135985775.gal : 10 ms
[2025-05-30 11:28:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9017583342104042652.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8129854549135985775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9017583342104042652.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,23994,1.13391,32352,2,5829,5,84405,6,0,688,71365,0


Converting to forward existential form...Done !
original formula: AG(!(E(EX(EG(((s1>=1)&&(l3077>=1)))) U ((s1>=1)&&(l3088>=1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),EX(EG(((s1>=1)&&(l3077>=1))))) * ((s1>=1)&&(l3088>=1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t91, t...620
(forward)formula 0,0,3.11216,73640,1,0,330,254961,395,131,4892,114339,410
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 237 transition count 440
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 237 transition count 440
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 126 place count 237 transition count 422
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 167 place count 196 transition count 371
Iterating global reduction 1 with 41 rules applied. Total rules applied 208 place count 196 transition count 371
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 224 place count 196 transition count 355
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 255 place count 165 transition count 306
Iterating global reduction 2 with 31 rules applied. Total rules applied 286 place count 165 transition count 306
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 311 place count 165 transition count 281
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 326 place count 150 transition count 243
Iterating global reduction 3 with 15 rules applied. Total rules applied 341 place count 150 transition count 243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 344 place count 150 transition count 240
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 353 place count 141 transition count 231
Iterating global reduction 4 with 9 rules applied. Total rules applied 362 place count 141 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 364 place count 141 transition count 229
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 369 place count 136 transition count 223
Iterating global reduction 5 with 5 rules applied. Total rules applied 374 place count 136 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 378 place count 136 transition count 219
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 381 place count 133 transition count 199
Iterating global reduction 6 with 3 rules applied. Total rules applied 384 place count 133 transition count 199
Applied a total of 384 rules in 41 ms. Remains 133 /291 variables (removed 158) and now considering 199/606 (removed 407) transitions.
// Phase 1: matrix 199 rows 133 cols
[2025-05-30 11:28:28] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:28:28] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-30 11:28:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:28:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-30 11:28:29] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-05-30 11:28:29] [INFO ] Invariant cache hit.
[2025-05-30 11:28:29] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/332 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 72/207 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/332 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 207 constraints, problems are : Problem set: 0 solved, 198 unsolved in 20724 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/332 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 72/207 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 198/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 405 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50897ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 50898ms
Starting structural reductions in LTL mode, iteration 1 : 133/291 places, 199/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52055 ms. Remains : 133/291 places, 199/606 transitions.
[2025-05-30 11:29:20] [INFO ] Flatten gal took : 14 ms
[2025-05-30 11:29:20] [INFO ] Flatten gal took : 15 ms
[2025-05-30 11:29:20] [INFO ] Input system was already deterministic with 199 transitions.
[2025-05-30 11:29:20] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:29:20] [INFO ] Flatten gal took : 13 ms
[2025-05-30 11:29:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9137772997988000768.gal : 8 ms
[2025-05-30 11:29:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11335185168655859438.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9137772997988000768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11335185168655859438.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,30289,1.31762,42616,2,7279,5,101819,6,0,731,101398,0


Converting to forward existential form...Done !
original formula: AF(AX((((s1>=1)&&(l3083>=1))&&(((p148<1)||(l0<1))||((l4284>=1)&&(l3>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((s1>=1)&&(l3083>=1))&&(((p148<1)||(l0<1))||((l4284>=1)&&(l3>=1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t74, t75, t76, t84, t85, t86, t87, t88, t90, t91, t92, t93, t...680
(forward)formula 0,0,5.51753,146492,1,0,528,507156,421,251,5174,411926,533
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 239 transition count 435
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 239 transition count 435
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 116 place count 239 transition count 423
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 156 place count 199 transition count 376
Iterating global reduction 1 with 40 rules applied. Total rules applied 196 place count 199 transition count 376
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 212 place count 199 transition count 360
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 239 place count 172 transition count 316
Iterating global reduction 2 with 27 rules applied. Total rules applied 266 place count 172 transition count 316
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 285 place count 172 transition count 297
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 299 place count 158 transition count 264
Iterating global reduction 3 with 14 rules applied. Total rules applied 313 place count 158 transition count 264
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 319 place count 158 transition count 258
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 326 place count 151 transition count 251
Iterating global reduction 4 with 7 rules applied. Total rules applied 333 place count 151 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 337 place count 151 transition count 247
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 339 place count 149 transition count 245
Iterating global reduction 5 with 2 rules applied. Total rules applied 341 place count 149 transition count 245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 344 place count 149 transition count 242
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 346 place count 147 transition count 230
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 147 transition count 230
Applied a total of 348 rules in 19 ms. Remains 147 /291 variables (removed 144) and now considering 230/606 (removed 376) transitions.
// Phase 1: matrix 230 rows 147 cols
[2025-05-30 11:29:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:29:26] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-05-30 11:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:29:26] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-30 11:29:27] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2025-05-30 11:29:27] [INFO ] Invariant cache hit.
[2025-05-30 11:29:27] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/377 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 87/236 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:29:42] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:29:42] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:29:43] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:29:43] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:29:52] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:29:53] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/377 variables, and 242 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 230/377 variables, 147/155 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 87/242 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 229/471 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/377 variables, and 471 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 147/291 places, 230/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61410 ms. Remains : 147/291 places, 230/606 transitions.
[2025-05-30 11:30:27] [INFO ] Flatten gal took : 20 ms
[2025-05-30 11:30:27] [INFO ] Flatten gal took : 18 ms
[2025-05-30 11:30:27] [INFO ] Input system was already deterministic with 230 transitions.
[2025-05-30 11:30:27] [INFO ] Flatten gal took : 17 ms
[2025-05-30 11:30:27] [INFO ] Flatten gal took : 17 ms
[2025-05-30 11:30:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8355346587581053924.gal : 6 ms
[2025-05-30 11:30:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15739807877336588949.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/CTLFireability8355346587581053924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15739807877336588949.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,37927,2.48743,67828,2,10904,5,157918,6,0,818,171618,0


Converting to forward existential form...Done !
original formula: ((AX(AF(EG(((p304>=1)&&(l3101>=1))))) * AF(AG(((s1<1)||(l2160<1))))) * AF(((AX(((s1>=1)&&(l4138>=1))) * ((s1<1)||(l4110<1))) * ((p242<1)|...166
=> equivalent forward existential formula: (([FwdG(EY(Init),!(EG(((p304>=1)&&(l3101>=1)))))] = FALSE * [FwdG(Init,!(!(E(TRUE U !(((s1<1)||(l2160<1)))))))] ...269
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t28, t41, t56, t57, t58, t77, t78, t82, t83, t84, t85, t86, t87, t88, t...875
(forward)formula 0,0,9.2498,223088,1,0,607,730027,485,278,5870,561907,599
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 239 transition count 448
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 239 transition count 448
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 122 place count 239 transition count 430
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 161 place count 200 transition count 381
Iterating global reduction 1 with 39 rules applied. Total rules applied 200 place count 200 transition count 381
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 216 place count 200 transition count 365
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 244 place count 172 transition count 319
Iterating global reduction 2 with 28 rules applied. Total rules applied 272 place count 172 transition count 319
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 292 place count 172 transition count 299
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 305 place count 159 transition count 274
Iterating global reduction 3 with 13 rules applied. Total rules applied 318 place count 159 transition count 274
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 321 place count 159 transition count 271
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 330 place count 150 transition count 262
Iterating global reduction 4 with 9 rules applied. Total rules applied 339 place count 150 transition count 262
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 343 place count 150 transition count 258
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 347 place count 146 transition count 253
Iterating global reduction 5 with 4 rules applied. Total rules applied 351 place count 146 transition count 253
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 354 place count 146 transition count 250
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 356 place count 144 transition count 237
Iterating global reduction 6 with 2 rules applied. Total rules applied 358 place count 144 transition count 237
Applied a total of 358 rules in 22 ms. Remains 144 /291 variables (removed 147) and now considering 237/606 (removed 369) transitions.
// Phase 1: matrix 237 rows 144 cols
[2025-05-30 11:30:37] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:30:37] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-30 11:30:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:30:37] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-05-30 11:30:38] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1322 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-05-30 11:30:38] [INFO ] Invariant cache hit.
[2025-05-30 11:30:38] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 237/381 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 105/251 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:30:54] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:30:54] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:30:55] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:30:55] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:31:03] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/381 variables, and 256 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 237/381 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 105/256 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 236/492 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/381 variables, and 492 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in LTL mode, iteration 1 : 144/291 places, 237/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61543 ms. Remains : 144/291 places, 237/606 transitions.
[2025-05-30 11:31:38] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:31:38] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:31:38] [INFO ] Input system was already deterministic with 237 transitions.
[2025-05-30 11:31:38] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:31:38] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:31:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13795864509351651182.gal : 3 ms
[2025-05-30 11:31:38] [INFO ] Time to serialize properties into /tmp/CTLFireability5915132876052198569.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/CTLFireability13795864509351651182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5915132876052198569.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,34331,2.39392,69400,2,9397,5,163761,6,0,813,153243,0


Converting to forward existential form...Done !
original formula: A(AG(((s1>=1)&&(l3083>=1))) U (AF(!((((p184>=1)&&(l0>=1))||((s1>=1)&&(l3663>=1))))) * A(((s1>=1)&&(l2754>=1)) U (EG(!(((s1>=1)&&(l2292>=1...194
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(!((((p184>=1)&&(l0>=1))||((s1>=1)&&(l3663>=1))))))) * !((E(!((EG(!(((s1>=1)&&(l2292>=1)...1098
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t53, t71, t73, t74, t78, t79, t80, t88, t89, t94, t95, t96, t97, t102, ...850
Using saturation style SCC detection
(forward)formula 0,1,10.8423,272360,1,0,585,1.26937e+06,519,261,5964,571636,707
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 241 transition count 460
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 241 transition count 460
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 118 place count 241 transition count 442
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 154 place count 205 transition count 399
Iterating global reduction 1 with 36 rules applied. Total rules applied 190 place count 205 transition count 399
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 207 place count 205 transition count 382
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 231 place count 181 transition count 343
Iterating global reduction 2 with 24 rules applied. Total rules applied 255 place count 181 transition count 343
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 276 place count 181 transition count 322
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 286 place count 171 transition count 299
Iterating global reduction 3 with 10 rules applied. Total rules applied 296 place count 171 transition count 299
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 305 place count 171 transition count 290
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 310 place count 166 transition count 285
Iterating global reduction 4 with 5 rules applied. Total rules applied 315 place count 166 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 316 place count 166 transition count 284
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 320 place count 162 transition count 279
Iterating global reduction 5 with 4 rules applied. Total rules applied 324 place count 162 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 325 place count 162 transition count 278
Applied a total of 325 rules in 58 ms. Remains 162 /291 variables (removed 129) and now considering 278/606 (removed 328) transitions.
// Phase 1: matrix 278 rows 162 cols
[2025-05-30 11:31:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:31:49] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-05-30 11:31:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:31:50] [INFO ] State equation strengthened by 124 read => feed constraints.
[2025-05-30 11:31:51] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:31:51] [INFO ] Redundant transitions in 17 ms returned []
Running 277 sub problems to find dead transitions.
[2025-05-30 11:31:51] [INFO ] Invariant cache hit.
[2025-05-30 11:31:51] [INFO ] State equation strengthened by 124 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 278/440 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 124/288 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:32:18] [INFO ] Deduced a trap composed of 62 places in 161 ms of which 17 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/440 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 289 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/440 variables, 162/165 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 124/289 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 277/566 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 566 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
Starting structural reductions in SI_CTL mode, iteration 1 : 162/291 places, 278/606 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62151 ms. Remains : 162/291 places, 278/606 transitions.
[2025-05-30 11:32:51] [INFO ] Flatten gal took : 16 ms
[2025-05-30 11:32:51] [INFO ] Flatten gal took : 15 ms
[2025-05-30 11:32:51] [INFO ] Input system was already deterministic with 278 transitions.
[2025-05-30 11:32:51] [INFO ] Flatten gal took : 15 ms
[2025-05-30 11:32:51] [INFO ] Flatten gal took : 15 ms
[2025-05-30 11:32:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10827842763967673153.gal : 4 ms
[2025-05-30 11:32:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17404822820879221797.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/CTLFireability10827842763967673153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17404822820879221797.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,50508,4.13354,99296,2,14431,5,231103,6,0,926,226848,0


Converting to forward existential form...Done !
original formula: A(!(E(((s1>=1)&&(l4120>=1)) U E(!(((s1>=1)&&(l2873>=1))) U ((s1>=1)&&(l2756>=1))))) U (!(EG(!(((((p281>=1)&&(l3103>=1))||((s1>=1)&&(l4156...309
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((((p281>=1)&&(l3103>=1))||((s1>=1)&&(l4156>=1)))&&(!((s1>=1)&&(l3083>=1))))))) * ((!(E...1043
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t49, t50, t52, t76, t77, t79, t80, t81, t82,...1159
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,26.8529,615316,1,0,1051,2.84746e+06,615,488,6747,1.41413e+06,1218
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 237 transition count 432
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 237 transition count 432
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 121 place count 237 transition count 419
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 161 place count 197 transition count 369
Iterating global reduction 1 with 40 rules applied. Total rules applied 201 place count 197 transition count 369
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 217 place count 197 transition count 353
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 245 place count 169 transition count 309
Iterating global reduction 2 with 28 rules applied. Total rules applied 273 place count 169 transition count 309
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 291 place count 169 transition count 291
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 306 place count 154 transition count 253
Iterating global reduction 3 with 15 rules applied. Total rules applied 321 place count 154 transition count 253
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 327 place count 154 transition count 247
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 336 place count 145 transition count 238
Iterating global reduction 4 with 9 rules applied. Total rules applied 345 place count 145 transition count 238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 349 place count 145 transition count 234
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 353 place count 141 transition count 229
Iterating global reduction 5 with 4 rules applied. Total rules applied 357 place count 141 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 360 place count 141 transition count 226
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 362 place count 139 transition count 213
Iterating global reduction 6 with 2 rules applied. Total rules applied 364 place count 139 transition count 213
Applied a total of 364 rules in 17 ms. Remains 139 /291 variables (removed 152) and now considering 213/606 (removed 393) transitions.
// Phase 1: matrix 213 rows 139 cols
[2025-05-30 11:33:19] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:33:19] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-30 11:33:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:33:19] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-05-30 11:33:20] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2025-05-30 11:33:20] [INFO ] Invariant cache hit.
[2025-05-30 11:33:20] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/352 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 82/223 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/352 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 223 constraints, problems are : Problem set: 0 solved, 212 unsolved in 23444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/352 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 82/223 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 212/435 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 435 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53596ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 53597ms
Starting structural reductions in LTL mode, iteration 1 : 139/291 places, 213/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54554 ms. Remains : 139/291 places, 213/606 transitions.
[2025-05-30 11:34:13] [INFO ] Flatten gal took : 13 ms
[2025-05-30 11:34:13] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:34:13] [INFO ] Input system was already deterministic with 213 transitions.
[2025-05-30 11:34:13] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:34:13] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:34:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13260291553394392871.gal : 3 ms
[2025-05-30 11:34:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3360158176680519806.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/CTLFireability13260291553394392871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3360158176680519806.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,32924,1.73946,44912,2,7181,5,116447,6,0,769,108533,0


Converting to forward existential form...Done !
original formula: AX(((EF(EX(((s1>=1)&&(l4112>=1)))) + ((s1>=1)&&(l3076>=1))) + (EF((((s1>=1)&&(l3833>=1))||((s1>=1)&&(l2720>=1)))) * AG(((s1>=1)&&(l4110>=...162
=> equivalent forward existential formula: ([((EY(Init) * !((E(TRUE U EX(((s1>=1)&&(l4112>=1)))) + ((s1>=1)&&(l3076>=1))))) * !(E(TRUE U (((s1>=1)&&(l3833>...326
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t70, t71, t75, t76, t77, t85, t86, t90, t91, t92, t93, t98, t99, t...656
(forward)formula 0,1,6.71313,159952,1,0,436,695551,451,188,5491,294355,544
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 240 transition count 460
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 240 transition count 460
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 119 place count 240 transition count 443
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 158 place count 201 transition count 394
Iterating global reduction 1 with 39 rules applied. Total rules applied 197 place count 201 transition count 394
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 213 place count 201 transition count 378
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 242 place count 172 transition count 331
Iterating global reduction 2 with 29 rules applied. Total rules applied 271 place count 172 transition count 331
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 296 place count 172 transition count 306
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 308 place count 160 transition count 283
Iterating global reduction 3 with 12 rules applied. Total rules applied 320 place count 160 transition count 283
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 326 place count 160 transition count 277
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 333 place count 153 transition count 270
Iterating global reduction 4 with 7 rules applied. Total rules applied 340 place count 153 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 343 place count 153 transition count 267
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 346 place count 150 transition count 263
Iterating global reduction 5 with 3 rules applied. Total rules applied 349 place count 150 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 353 place count 150 transition count 259
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 356 place count 147 transition count 239
Iterating global reduction 6 with 3 rules applied. Total rules applied 359 place count 147 transition count 239
Applied a total of 359 rules in 16 ms. Remains 147 /291 variables (removed 144) and now considering 239/606 (removed 367) transitions.
// Phase 1: matrix 239 rows 147 cols
[2025-05-30 11:34:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:20] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-30 11:34:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:20] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-05-30 11:34:21] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2025-05-30 11:34:21] [INFO ] Invariant cache hit.
[2025-05-30 11:34:21] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/386 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 98/247 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 247 constraints, problems are : Problem set: 0 solved, 238 unsolved in 29279 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/386 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 98/247 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 238/485 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 485 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59540ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 59541ms
Starting structural reductions in LTL mode, iteration 1 : 147/291 places, 239/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60689 ms. Remains : 147/291 places, 239/606 transitions.
[2025-05-30 11:35:21] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:35:21] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:35:21] [INFO ] Input system was already deterministic with 239 transitions.
[2025-05-30 11:35:21] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:35:21] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:35:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9984049104042241060.gal : 3 ms
[2025-05-30 11:35:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4065982919476988464.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/CTLFireability9984049104042241060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4065982919476988464.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,40125,2.40401,64688,2,9524,5,159495,6,0,827,150795,0


Converting to forward existential form...Done !
original formula: EX(E((((((s1>=1)&&(l4102>=1))||((p144>=1)&&(l0>=1)))||((s1>=1)&&(l3092>=1))) * (!(((s1>=1)&&(l4132>=1))) + AG(((s1>=1)&&(l2169>=1))))) U ...178
=> equivalent forward existential formula: [(FwdU(EY(Init),(((((s1>=1)&&(l4102>=1))||((p144>=1)&&(l0>=1)))||((s1>=1)&&(l3092>=1))) * (!(((s1>=1)&&(l4132>=1...236
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t40, t70, t71, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t...928
(forward)formula 0,0,6.74043,144168,1,0,427,486990,508,157,5974,184213,495
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 239 transition count 445
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 239 transition count 445
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 119 place count 239 transition count 430
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 158 place count 200 transition count 381
Iterating global reduction 1 with 39 rules applied. Total rules applied 197 place count 200 transition count 381
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 210 place count 200 transition count 368
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 239 place count 171 transition count 322
Iterating global reduction 2 with 29 rules applied. Total rules applied 268 place count 171 transition count 322
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 287 place count 171 transition count 303
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 301 place count 157 transition count 270
Iterating global reduction 3 with 14 rules applied. Total rules applied 315 place count 157 transition count 270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 319 place count 157 transition count 266
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 327 place count 149 transition count 258
Iterating global reduction 4 with 8 rules applied. Total rules applied 335 place count 149 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 339 place count 149 transition count 254
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 342 place count 146 transition count 250
Iterating global reduction 5 with 3 rules applied. Total rules applied 345 place count 146 transition count 250
Applied a total of 345 rules in 14 ms. Remains 146 /291 variables (removed 145) and now considering 250/606 (removed 356) transitions.
// Phase 1: matrix 250 rows 146 cols
[2025-05-30 11:35:28] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:35:28] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-05-30 11:35:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:35:28] [INFO ] State equation strengthened by 115 read => feed constraints.
[2025-05-30 11:35:29] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2025-05-30 11:35:29] [INFO ] Invariant cache hit.
[2025-05-30 11:35:29] [INFO ] State equation strengthened by 115 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/396 variables, 146/148 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 115/263 constraints. Problems are: Problem set: 0 solved, 249 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 263 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/396 variables, 146/148 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 115/263 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 249/512 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 512 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in LTL mode, iteration 1 : 146/291 places, 250/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61674 ms. Remains : 146/291 places, 250/606 transitions.
[2025-05-30 11:36:29] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:36:29] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:36:29] [INFO ] Input system was already deterministic with 250 transitions.
[2025-05-30 11:36:29] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:36:29] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:36:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15970391542687781085.gal : 2 ms
[2025-05-30 11:36:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17469127022517521059.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/CTLFireability15970391542687781085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17469127022517521059.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,37788,2.1641,61368,2,8950,5,150100,6,0,834,145368,0


Converting to forward existential form...Done !
original formula: (AF(((EG(((s1>=1)&&(l4110>=1))) * (s1>=1)) * (l3088>=1))) * (EX(AG(AF(((s1<1)||(l3082<1))))) + (AG(!(A(((s1>=1)&&(l3846>=1)) U (((s1>=1)&...249
=> equivalent forward existential formula: ([FwdG(Init,!(((EG(((s1>=1)&&(l4110>=1))) * (s1>=1)) * (l3088>=1))))] = FALSE * ([((FwdU((Init * !(EX(!(E(TRUE U...545
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t...922
(forward)formula 0,0,13.0483,307724,1,0,598,1.26552e+06,549,250,6131,693643,741
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2025-08 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 : 291/291 places, 606/606 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 239 transition count 430
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 239 transition count 430
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 114 place count 239 transition count 420
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 155 place count 198 transition count 369
Iterating global reduction 1 with 41 rules applied. Total rules applied 196 place count 198 transition count 369
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 212 place count 198 transition count 353
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 242 place count 168 transition count 308
Iterating global reduction 2 with 30 rules applied. Total rules applied 272 place count 168 transition count 308
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 292 place count 168 transition count 288
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 307 place count 153 transition count 250
Iterating global reduction 3 with 15 rules applied. Total rules applied 322 place count 153 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 328 place count 153 transition count 244
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 336 place count 145 transition count 236
Iterating global reduction 4 with 8 rules applied. Total rules applied 344 place count 145 transition count 236
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 348 place count 145 transition count 232
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 351 place count 142 transition count 228
Iterating global reduction 5 with 3 rules applied. Total rules applied 354 place count 142 transition count 228
Applied a total of 354 rules in 43 ms. Remains 142 /291 variables (removed 149) and now considering 228/606 (removed 378) transitions.
// Phase 1: matrix 228 rows 142 cols
[2025-05-30 11:36:43] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:36:43] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-05-30 11:36:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:36:43] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-30 11:36:44] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:36:44] [INFO ] Redundant transitions in 4 ms returned []
Running 227 sub problems to find dead transitions.
[2025-05-30 11:36:44] [INFO ] Invariant cache hit.
[2025-05-30 11:36:44] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 228/370 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 93/237 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 237 constraints, problems are : Problem set: 0 solved, 227 unsolved in 26420 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 228/370 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 93/237 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 227/464 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 464 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56675ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 56676ms
Starting structural reductions in SI_CTL mode, iteration 1 : 142/291 places, 228/606 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58076 ms. Remains : 142/291 places, 228/606 transitions.
[2025-05-30 11:37:41] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:37:41] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:37:41] [INFO ] Input system was already deterministic with 228 transitions.
[2025-05-30 11:37:41] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:37:41] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:37:41] [INFO ] Time to serialize gal into /tmp/CTLFireability709296175632264761.gal : 3 ms
[2025-05-30 11:37:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5941009712976749746.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/CTLFireability709296175632264761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5941009712976749746.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,33852,2.03614,50368,2,8302,5,121926,6,0,796,127904,0


Converting to forward existential form...Done !
original formula: AF(AG((E(((s1>=1)&&(l1783>=1)) U ((s1>=1)&&(l1791>=1))) * (((s1<1)||(l4113<1))||(((s1>=1)&&(l2315>=1))&&(l1799>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(((s1>=1)&&(l1783>=1)) U ((s1>=1)&&(l1791>=1))) * (((s1<1)||(l4113<1))||(((s1>=1)&&(...194
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t28, t29, t30, t56, t58, t59, t61, t79, t80, t84, t85, t86, t87, t...810
(forward)formula 0,0,7.80699,158220,1,0,411,462671,486,157,5857,323730,488
FORMULA DBSingleClientW-PT-d2m04-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 : 291/291 places, 606/606 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 235 transition count 430
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 235 transition count 430
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 127 place count 235 transition count 415
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 170 place count 192 transition count 362
Iterating global reduction 1 with 43 rules applied. Total rules applied 213 place count 192 transition count 362
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 229 place count 192 transition count 346
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 261 place count 160 transition count 295
Iterating global reduction 2 with 32 rules applied. Total rules applied 293 place count 160 transition count 295
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 314 place count 160 transition count 274
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 331 place count 143 transition count 227
Iterating global reduction 3 with 17 rules applied. Total rules applied 348 place count 143 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 351 place count 143 transition count 224
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 361 place count 133 transition count 214
Iterating global reduction 4 with 10 rules applied. Total rules applied 371 place count 133 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 375 place count 133 transition count 210
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 380 place count 128 transition count 204
Iterating global reduction 5 with 5 rules applied. Total rules applied 385 place count 128 transition count 204
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 390 place count 128 transition count 199
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 393 place count 125 transition count 179
Iterating global reduction 6 with 3 rules applied. Total rules applied 396 place count 125 transition count 179
Applied a total of 396 rules in 39 ms. Remains 125 /291 variables (removed 166) and now considering 179/606 (removed 427) transitions.
// Phase 1: matrix 179 rows 125 cols
[2025-05-30 11:37:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:37:49] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-05-30 11:37:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:37:49] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 11:37:49] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:37:49] [INFO ] Redundant transitions in 3 ms returned []
Running 178 sub problems to find dead transitions.
[2025-05-30 11:37:49] [INFO ] Invariant cache hit.
[2025-05-30 11:37:49] [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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:37:58] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:37:59] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:37:59] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:37:59] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:37:59] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:38:00] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/193 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:38:08] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:38:08] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/304 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/304 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 195 constraints, problems are : Problem set: 0 solved, 178 unsolved in 29856 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/304 variables, 125/135 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 60/195 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 178/373 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 373 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60031ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 60032ms
Starting structural reductions in SI_CTL mode, iteration 1 : 125/291 places, 179/606 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60830 ms. Remains : 125/291 places, 179/606 transitions.
[2025-05-30 11:38:49] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:38:49] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:38:49] [INFO ] Input system was already deterministic with 179 transitions.
[2025-05-30 11:38:49] [INFO ] Flatten gal took : 15 ms
[2025-05-30 11:38:50] [INFO ] Flatten gal took : 15 ms
[2025-05-30 11:38:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1387593174224315941.gal : 6 ms
[2025-05-30 11:38:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12529746858849440998.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/ReachabilityCardinality1387593174224315941.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12529746858849440998.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9240 resets) in 202 ms. (197 steps per ms) remains 1/1 properties

its-reach command run as :

BEST_FIRST walk for 40003 steps (1776 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12529746858849440998.prop.
Finished probabilistic random walk after 24090 steps, run visited all 1 properties in 57 ms. (steps per millisecond=422 )
Probabilistic random walk after 24090 steps, saw 10868 distinct states, run finished after 63 ms. (steps per millisecond=382 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 238 transition count 438
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 238 transition count 438
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 121 place count 238 transition count 423
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 161 place count 198 transition count 374
Iterating global reduction 1 with 40 rules applied. Total rules applied 201 place count 198 transition count 374
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 215 place count 198 transition count 360
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 246 place count 167 transition count 311
Iterating global reduction 2 with 31 rules applied. Total rules applied 277 place count 167 transition count 311
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 297 place count 167 transition count 291
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 312 place count 152 transition count 259
Iterating global reduction 3 with 15 rules applied. Total rules applied 327 place count 152 transition count 259
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 333 place count 152 transition count 253
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 342 place count 143 transition count 244
Iterating global reduction 4 with 9 rules applied. Total rules applied 351 place count 143 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 355 place count 143 transition count 240
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 359 place count 139 transition count 235
Iterating global reduction 5 with 4 rules applied. Total rules applied 363 place count 139 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 367 place count 139 transition count 231
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 370 place count 136 transition count 211
Iterating global reduction 6 with 3 rules applied. Total rules applied 373 place count 136 transition count 211
Applied a total of 373 rules in 39 ms. Remains 136 /291 variables (removed 155) and now considering 211/606 (removed 395) transitions.
// Phase 1: matrix 211 rows 136 cols
[2025-05-30 11:38:50] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:38:50] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-05-30 11:38:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:38:50] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-05-30 11:38:51] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:38:51] [INFO ] Redundant transitions in 2 ms returned []
Running 210 sub problems to find dead transitions.
[2025-05-30 11:38:51] [INFO ] Invariant cache hit.
[2025-05-30 11:38:51] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/347 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 82/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:39:02] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:39:02] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:39:02] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 26 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 223 constraints, problems are : Problem set: 0 solved, 210 unsolved in 28453 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 211/347 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 82/223 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 210/433 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/347 variables, and 433 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58602ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 58603ms
Starting structural reductions in SI_CTL mode, iteration 1 : 136/291 places, 211/606 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59646 ms. Remains : 136/291 places, 211/606 transitions.
[2025-05-30 11:39:49] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:39:49] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:39:49] [INFO ] Input system was already deterministic with 211 transitions.
[2025-05-30 11:39:49] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:39:49] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:39:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1948560926046942092.gal : 2 ms
[2025-05-30 11:39:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2128622332582690694.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/CTLFireability1948560926046942092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2128622332582690694.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,29983,1.73184,42952,2,7305,5,106677,6,0,755,105397,0


Converting to forward existential form...Done !
original formula: E(!((((AG(!(((s1>=1)&&(l4112>=1)))) + ((s1>=1)&&(l3656>=1))) + ((p319>=1)&&(l3093>=1))) * (EG(((p121>=1)&&(l0>=1))) + ((s1>=1)&&(l3086>=1...184
=> equivalent forward existential formula: [(FwdU(Init,!((((!(E(TRUE U !(!(((s1>=1)&&(l4112>=1)))))) + ((s1>=1)&&(l3656>=1))) + ((p319>=1)&&(l3093>=1))) * ...242
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t71, t72, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, t...707
(forward)formula 0,1,8.29154,189768,1,0,530,708413,458,274,5507,503020,671
FORMULA DBSingleClientW-PT-d2m04-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 : 291/291 places, 606/606 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 236 transition count 421
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 236 transition count 421
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 123 place count 236 transition count 408
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 164 place count 195 transition count 358
Iterating global reduction 1 with 41 rules applied. Total rules applied 205 place count 195 transition count 358
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 219 place count 195 transition count 344
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 251 place count 163 transition count 293
Iterating global reduction 2 with 32 rules applied. Total rules applied 283 place count 163 transition count 293
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 304 place count 163 transition count 272
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 320 place count 147 transition count 232
Iterating global reduction 3 with 16 rules applied. Total rules applied 336 place count 147 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 339 place count 147 transition count 229
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 349 place count 137 transition count 219
Iterating global reduction 4 with 10 rules applied. Total rules applied 359 place count 137 transition count 219
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 363 place count 137 transition count 215
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 368 place count 132 transition count 209
Iterating global reduction 5 with 5 rules applied. Total rules applied 373 place count 132 transition count 209
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 377 place count 132 transition count 205
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 380 place count 129 transition count 185
Iterating global reduction 6 with 3 rules applied. Total rules applied 383 place count 129 transition count 185
Applied a total of 383 rules in 18 ms. Remains 129 /291 variables (removed 162) and now considering 185/606 (removed 421) transitions.
// Phase 1: matrix 185 rows 129 cols
[2025-05-30 11:39:58] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:39:58] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-05-30 11:39:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:39:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 11:39:59] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1642 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-05-30 11:39:59] [INFO ] Invariant cache hit.
[2025-05-30 11:39:59] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/314 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 184 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 192 constraints, problems are : Problem set: 0 solved, 184 unsolved in 22491 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/314 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 61/192 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 184/376 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/314 variables, and 376 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52600ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 52601ms
Starting structural reductions in LTL mode, iteration 1 : 129/291 places, 185/606 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54263 ms. Remains : 129/291 places, 185/606 transitions.
[2025-05-30 11:40:52] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:40:52] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:40:52] [INFO ] Input system was already deterministic with 185 transitions.
[2025-05-30 11:40:52] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:40:52] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:40:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4929411439714136435.gal : 1 ms
[2025-05-30 11:40:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5538498084131497847.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/CTLFireability4929411439714136435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5538498084131497847.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,24444,1.25032,34400,2,6181,5,83975,6,0,701,79844,0


Converting to forward existential form...Done !
original formula: EX(E(EF(((p109>=1)&&(l0>=1))) U ((p121>=1)&&(l0>=1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),E(TRUE U ((p109>=1)&&(l0>=1)))) * ((p121>=1)&&(l0>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t71, t72, t76, t77, t78, t86, t87, t93, t94, t95, t97, t98, t99, t101, ...591
(forward)formula 0,1,5.19749,129576,1,0,509,502059,396,255,4980,306337,603
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 237 transition count 423
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 237 transition count 423
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 120 place count 237 transition count 411
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 160 place count 197 transition count 362
Iterating global reduction 1 with 40 rules applied. Total rules applied 200 place count 197 transition count 362
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 215 place count 197 transition count 347
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 246 place count 166 transition count 301
Iterating global reduction 2 with 31 rules applied. Total rules applied 277 place count 166 transition count 301
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 298 place count 166 transition count 280
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 312 place count 152 transition count 243
Iterating global reduction 3 with 14 rules applied. Total rules applied 326 place count 152 transition count 243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 329 place count 152 transition count 240
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 337 place count 144 transition count 232
Iterating global reduction 4 with 8 rules applied. Total rules applied 345 place count 144 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 347 place count 144 transition count 230
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 352 place count 139 transition count 224
Iterating global reduction 5 with 5 rules applied. Total rules applied 357 place count 139 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 361 place count 139 transition count 220
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 364 place count 136 transition count 200
Iterating global reduction 6 with 3 rules applied. Total rules applied 367 place count 136 transition count 200
Applied a total of 367 rules in 31 ms. Remains 136 /291 variables (removed 155) and now considering 200/606 (removed 406) transitions.
// Phase 1: matrix 200 rows 136 cols
[2025-05-30 11:40:57] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:40:57] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-30 11:40:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:40:58] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-30 11:40:58] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:40:58] [INFO ] Redundant transitions in 2 ms returned []
Running 199 sub problems to find dead transitions.
[2025-05-30 11:40:58] [INFO ] Invariant cache hit.
[2025-05-30 11:40:58] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/336 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 65/203 constraints. Problems are: Problem set: 0 solved, 199 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 203 constraints, problems are : Problem set: 0 solved, 199 unsolved in 17983 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/336 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 65/203 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 199/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 336/336 variables, and 402 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48212ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 48213ms
Starting structural reductions in SI_CTL mode, iteration 1 : 136/291 places, 200/606 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49002 ms. Remains : 136/291 places, 200/606 transitions.
[2025-05-30 11:41:46] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:41:46] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:41:46] [INFO ] Input system was already deterministic with 200 transitions.
[2025-05-30 11:41:46] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:41:46] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:41:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7617211273647244894.gal : 2 ms
[2025-05-30 11:41:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3307003185342684761.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/CTLFireability7617211273647244894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3307003185342684761.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,34664,1.9222,50472,2,7999,5,129936,6,0,744,125708,0


Converting to forward existential form...Done !
original formula: E(((s1>=1)&&(l4148>=1)) U AG(!((((s1>=1)&&(l1731>=1))||((p343>=1)&&(l2145>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,((s1>=1)&&(l4148>=1))) * !(E(TRUE U !(!((((s1>=1)&&(l1731>=1))||((p343>=1)&&(l2145>=1))))))))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t28, t70, t71, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t...710
Hit Full ! (commute/partial/dont) 3/194/197
(forward)formula 0,0,6.30708,143000,1,0,424,540580,428,166,5492,232993,486
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 606/606 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 238 transition count 439
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 238 transition count 439
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 119 place count 238 transition count 426
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 158 place count 199 transition count 377
Iterating global reduction 1 with 39 rules applied. Total rules applied 197 place count 199 transition count 377
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 211 place count 199 transition count 363
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 239 place count 171 transition count 320
Iterating global reduction 2 with 28 rules applied. Total rules applied 267 place count 171 transition count 320
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 285 place count 171 transition count 302
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 298 place count 158 transition count 273
Iterating global reduction 3 with 13 rules applied. Total rules applied 311 place count 158 transition count 273
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 317 place count 158 transition count 267
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 326 place count 149 transition count 258
Iterating global reduction 4 with 9 rules applied. Total rules applied 335 place count 149 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 338 place count 149 transition count 255
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 343 place count 144 transition count 249
Iterating global reduction 5 with 5 rules applied. Total rules applied 348 place count 144 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 352 place count 144 transition count 245
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 355 place count 141 transition count 225
Iterating global reduction 6 with 3 rules applied. Total rules applied 358 place count 141 transition count 225
Applied a total of 358 rules in 31 ms. Remains 141 /291 variables (removed 150) and now considering 225/606 (removed 381) transitions.
// Phase 1: matrix 225 rows 141 cols
[2025-05-30 11:41:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:41:53] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-30 11:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:41:53] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-30 11:41:54] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:41:54] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2025-05-30 11:41:54] [INFO ] Invariant cache hit.
[2025-05-30 11:41:54] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/366 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 90/233 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:42:06] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:42:14] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:42:20] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:42:20] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 237 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/366 variables, 141/147 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 90/237 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 224/461 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 461 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in SI_CTL mode, iteration 1 : 141/291 places, 225/606 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61171 ms. Remains : 141/291 places, 225/606 transitions.
[2025-05-30 11:42:54] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:42:54] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:42:54] [INFO ] Input system was already deterministic with 225 transitions.
[2025-05-30 11:42:54] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:42:54] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:42:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10188688578332994068.gal : 1 ms
[2025-05-30 11:42:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16175445071073014707.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/CTLFireability10188688578332994068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16175445071073014707.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,34501,1.98062,50324,2,8264,5,128260,6,0,789,119343,0


Converting to forward existential form...Done !
original formula: EF(!(E((((s1>=1)&&(l2801>=1)) + AG(!(((s1>=1)&&(l4106>=1))))) U (!((((s1>=1)&&(l4102>=1))||((s1>=1)&&(l3082>=1)))) * EG(AF(((s1>=1)&&(l38...168
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((((s1>=1)&&(l2801>=1)) + !(E(TRUE U !(!(((s1>=1)&&(l4106>=1))))))) U (!((((s1>=1)&&(l410...238
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t71, t72, t76, t77, t78, t86, t87, t91, t92, t93, t94, t95, t96, t...726
Using saturation style SCC detection
(forward)formula 0,1,9.65136,229932,1,0,552,1.09961e+06,491,237,5767,487461,677
FORMULA DBSingleClientW-PT-d2m04-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 11:43:04] [INFO ] Flatten gal took : 14 ms
[2025-05-30 11:43:04] [INFO ] Flatten gal took : 14 ms
Total runtime 1025862 ms.

BK_STOP 1748605384271

--------------------
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-d2m04"
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-d2m04, 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-174854063500114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m04.tgz
mv DBSingleClientW-PT-d2m04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;