About the Execution of ITS-Tools for FireWire-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2919199.00 | 0.00 | 0.00 | TFFFFTTFTFFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102200258.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 FireWire-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102200258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 86K 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 FireWire-PT-03-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-15
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-00
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-01
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-02
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-03
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-04
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-05
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-06
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-07
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-08
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-09
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-10
FORMULA_NAME FireWire-PT-03-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748843261211
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 05:47:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:47:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:47:44] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2025-06-02 05:47:44] [INFO ] Transformed 112 places.
[2025-06-02 05:47:44] [INFO ] Transformed 356 transitions.
[2025-06-02 05:47:44] [INFO ] Found NUPN structural information;
[2025-06-02 05:47:44] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 75 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 303/303 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 112 transition count 297
Applied a total of 6 rules in 51 ms. Remains 112 /112 variables (removed 0) and now considering 297/303 (removed 6) transitions.
[2025-06-02 05:47:44] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
// Phase 1: matrix 271 rows 112 cols
[2025-06-02 05:47:44] [INFO ] Computed 9 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:47:45] [INFO ] Implicit Places using invariants in 477 ms returned []
[2025-06-02 05:47:45] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2025-06-02 05:47:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:47:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 05:47:45] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2025-06-02 05:47:45] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2025-06-02 05:47:45] [INFO ] Invariant cache hit.
[2025-06-02 05:47:45] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:52] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:52] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:52] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:53] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:53] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:53] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:53] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:47:54] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/383 variables, and 282 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30051 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 296/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/383 variables, and 577 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30033 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60573ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60617ms
Starting structural reductions in LTL mode, iteration 1 : 112/112 places, 297/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61674 ms. Remains : 112/112 places, 297/303 transitions.
Support contains 75 out of 112 places after structural reductions.
[2025-06-02 05:48:46] [INFO ] Flatten gal took : 112 ms
[2025-06-02 05:48:46] [INFO ] Flatten gal took : 57 ms
[2025-06-02 05:48:46] [INFO ] Input system was already deterministic with 297 transitions.
Reduction of identical properties reduced properties to check from 80 to 78
RANDOM walk for 40000 steps (1977 resets) in 2777 ms. (14 steps per ms) remains 49/78 properties
BEST_FIRST walk for 4004 steps (11 resets) in 35 ms. (111 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (47 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (51 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (39 resets) in 43 ms. (90 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (28 resets) in 38 ms. (102 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (93 resets) in 76 ms. (52 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (18 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 43/49 properties
BEST_FIRST walk for 4003 steps (48 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (17 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (60 resets) in 49 ms. (80 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (30 resets) in 28 ms. (137 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (49 resets) in 35 ms. (111 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (18 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (56 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (58 resets) in 24 ms. (160 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (42 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 39/42 properties
BEST_FIRST walk for 4004 steps (46 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (78 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (41 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (23 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (51 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (39 resets) in 25 ms. (154 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (65 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (81 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (24 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (45 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (20 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (44 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (48 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
[2025-06-02 05:48:48] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2025-06-02 05:48:48] [INFO ] Invariant cache hit.
[2025-06-02 05:48:48] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 2 (OVERLAPS) 64/112 variables, 9/57 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 64/121 constraints. Problems are: Problem set: 8 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:48] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:48] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:49] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:49] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/125 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/125 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/237 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/277 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/277 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/278 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/278 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/278 constraints. Problems are: Problem set: 8 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 278 constraints, problems are : Problem set: 8 solved, 30 unsolved in 2744 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 30 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 67/101 variables, 5/39 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 67/106 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/109 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/109 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 11/112 variables, 4/113 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 11/124 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/125 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/125 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 270/382 variables, 112/237 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 40/277 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 30/307 constraints. Problems are: Problem set: 8 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:53] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 1/308 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/308 constraints. Problems are: Problem set: 8 solved, 30 unsolved
At refinement iteration 15 (OVERLAPS) 1/383 variables, 1/309 constraints. Problems are: Problem set: 8 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 309 constraints, problems are : Problem set: 8 solved, 30 unsolved in 5012 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 30/38 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7826ms problems are : Problem set: 8 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 297/297 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 293
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 110 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 108 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 107 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 107 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 107 transition count 286
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 107 transition count 288
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 106 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 106 transition count 284
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 106 transition count 284
Applied a total of 25 rules in 169 ms. Remains 106 /112 variables (removed 6) and now considering 284/297 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 106/112 places, 284/297 transitions.
RANDOM walk for 40000 steps (2165 resets) in 594 ms. (67 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (54 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (50 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (59 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (54 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (25 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (60 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (50 resets) in 50 ms. (78 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (63 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (100 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (62 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (10 resets) in 51 ms. (77 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (62 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (56 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (55 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (108 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (36 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (53 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 488579 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :9 out of 28
Probabilistic random walk after 488579 steps, saw 92432 distinct states, run finished after 3008 ms. (steps per millisecond=162 ) properties seen :9
[2025-06-02 05:48:59] [INFO ] Flow matrix only has 260 transitions (discarded 24 similar events)
// Phase 1: matrix 260 rows 106 cols
[2025-06-02 05:48:59] [INFO ] Computed 9 invariants in 4 ms
[2025-06-02 05:48:59] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 73/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:48:59] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:00] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 9/106 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 260/366 variables, 106/117 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 41/158 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 158 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2457 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 106/106 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 73/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 9/106 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 260/366 variables, 106/117 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 41/158 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 19/177 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:03] [INFO ] Deduced a trap along path composed of 16 places in 44 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 178 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3782 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 106/106 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6279ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 2153 ms.
Support contains 24 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 104 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 104 transition count 278
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 102 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 102 transition count 274
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 102 transition count 274
Applied a total of 9 rules in 41 ms. Remains 102 /106 variables (removed 4) and now considering 274/284 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 102/106 places, 274/284 transitions.
RANDOM walk for 40000 steps (2235 resets) in 426 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (53 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (54 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (48 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (57 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (66 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (52 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (48 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (93 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (66 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (51 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 468058 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 19
Probabilistic random walk after 468058 steps, saw 88546 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2025-06-02 05:49:11] [INFO ] Flow matrix only has 250 transitions (discarded 24 similar events)
// Phase 1: matrix 250 rows 102 cols
[2025-06-02 05:49:11] [INFO ] Computed 9 invariants in 7 ms
[2025-06-02 05:49:11] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 69/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:11] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:11] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 9/102 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 250/352 variables, 102/113 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 39/152 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 152 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2131 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 69/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 9/102 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:13] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 250/352 variables, 102/115 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 19/173 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/352 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 173 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3400 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5555ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 2055 ms.
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 274/274 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 102/102 places, 274/274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 274/274 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2025-06-02 05:49:19] [INFO ] Flow matrix only has 250 transitions (discarded 24 similar events)
[2025-06-02 05:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:49:19] [INFO ] Implicit Places using invariants in 83 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/102 places, 274/274 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 101 transition count 273
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 273
Applied a total of 2 rules in 12 ms. Remains 100 /101 variables (removed 1) and now considering 273/274 (removed 1) transitions.
[2025-06-02 05:49:19] [INFO ] Flow matrix only has 249 transitions (discarded 24 similar events)
// Phase 1: matrix 249 rows 100 cols
[2025-06-02 05:49:19] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:49:19] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-02 05:49:19] [INFO ] Flow matrix only has 249 transitions (discarded 24 similar events)
[2025-06-02 05:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:49:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 05:49:19] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 100/102 places, 273/274 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 439 ms. Remains : 100/102 places, 273/274 transitions.
RANDOM walk for 40000 steps (2314 resets) in 267 ms. (149 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (49 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (76 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (23 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (55 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (24 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (71 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (56 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (62 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (53 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (123 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (55 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 204357 steps, run visited all 18 properties in 734 ms. (steps per millisecond=278 )
Probabilistic random walk after 204357 steps, saw 44875 distinct states, run finished after 741 ms. (steps per millisecond=275 ) properties seen :18
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-03-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 05:49:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 05:49:20] [INFO ] Flatten gal took : 26 ms
FORMULA FireWire-PT-03-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 05:49:20] [INFO ] Flatten gal took : 25 ms
[2025-06-02 05:49:20] [INFO ] Input system was already deterministic with 297 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 9 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2025-06-02 05:49:20] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2025-06-02 05:49:20] [INFO ] Computed 9 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:49:20] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 05:49:20] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 05:49:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:49:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 05:49:21] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2025-06-02 05:49:21] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 05:49:21] [INFO ] Invariant cache hit.
[2025-06-02 05:49:21] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:24] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:24] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:24] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:24] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:25] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:25] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:25] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:49:26] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 163 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 284/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60508 ms. Remains : 107/112 places, 285/297 transitions.
[2025-06-02 05:50:21] [INFO ] Flatten gal took : 31 ms
[2025-06-02 05:50:21] [INFO ] Flatten gal took : 31 ms
[2025-06-02 05:50:21] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 05:50:21] [INFO ] Flatten gal took : 26 ms
[2025-06-02 05:50:21] [INFO ] Flatten gal took : 26 ms
[2025-06-02 05:50:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5827033191707211787.gal : 16 ms
[2025-06-02 05:50:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7040897391940299983.ctl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5827033191707211787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7040897391940299983.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,5.45564e+06,3.56815,76664,2,4437,5,220184,6,0,710,221203,0
Converting to forward existential form...Done !
original formula: E(!(((EG(AX((((p7==1)&&(p78==1))&&(p49==1)))) + EG(AX(((p43==1)&&(p57==1))))) + AG((p7!=1)))) U !((EF(!(((p45==1)&&(p58==1)))) + ((EF((EX...251
=> equivalent forward existential formula: [((FwdU(Init,!(((EG(!(EX(!((((p7==1)&&(p78==1))&&(p49==1)))))) + EG(!(EX(!(((p43==1)&&(p57==1))))))) + !(E(TRUE ...336
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
(forward)formula 0,0,6.46381,96556,1,0,504,426348,589,259,5993,369893,577
FORMULA FireWire-PT-03-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 7 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2025-06-02 05:50:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 05:50:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:50:28] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 05:50:28] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 05:50:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:50:28] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 05:50:28] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2025-06-02 05:50:28] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 05:50:28] [INFO ] Invariant cache hit.
[2025-06-02 05:50:28] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:32] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:32] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:32] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:32] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:33] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:33] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:33] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:50:34] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 (/ 3.0 2.0))
(t11 0.0)
(t12 1.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 (/ 7.0 8.0))
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 (/ 7.0 8.0))
(t37 0.0)
(t38 1.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 1.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 1.0)
(t50 1.0)
(t51 0.0)
(t52 1.0)
(t53 1.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 (/ 3.0 2.0))
(t90 0.0)
(t91 (/ 7.0 8.0))
(t92 (/ 1.0 8.0))
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 (/ 7.0 8.0))
(t110 (/ 9.0 8.0))
(t111 0.0)
(t112 (/ 7.0 8.0))
(t113 0.0)
(t114 (/ 9.0 8.0))
(t115 (/ 7.0 8.0))
(t116 (/ 1.0 8.0))
(t117 0.0)
(t118 1.0)
(t119 (/ 7.0 8.0))
(t120 (/ 1.0 8.0))
(t121 0.0)
(t122 (/ 7.0 8.0))
(t123 (/ 1.0 8.0))
(t124 0.0)
(t125 (/ 7.0 8.0))
(t126 (/ 1.0 8.0))
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 1.0)
(t132 0.0)
(t133 1.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 1.0)
(t155 0.0)
(t156 0.0)
(t157 1.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 1.0)
(t174 0.0)
(t175 0.0)
(t176 1.0)
(t177 (/ 7.0 8.0))
(t178 (/ 1.0 8.0))
(t179 0.0)
(t180 (/ 7.0 8.0))
(t181 (/ 1.0 8.0))
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 1.0)
(t187 0.0)
(t188 0.0)
(t189 2.0)
(t190 (/ 7.0 8.0))
(t191 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 163 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 284/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60503 ms. Remains : 107/112 places, 285/297 transitions.
[2025-06-02 05:51:28] [INFO ] Flatten gal took : 25 ms
[2025-06-02 05:51:28] [INFO ] Flatten gal took : 26 ms
[2025-06-02 05:51:28] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 05:51:28] [INFO ] Flatten gal took : 16 ms
[2025-06-02 05:51:28] [INFO ] Flatten gal took : 15 ms
[2025-06-02 05:51:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11912061718615785200.gal : 4 ms
[2025-06-02 05:51:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7049278483548108223.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/CTLFireability11912061718615785200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7049278483548108223.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,5.45564e+06,3.42046,76804,2,4437,5,220184,6,0,710,221203,0
Converting to forward existential form...Done !
original formula: EF(EX(((p3==1)&&(p68==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((p3==1)&&(p68==1)))] != FALSE
(forward)formula 0,1,3.56889,76804,1,0,8,220184,8,1,1301,221203,2
FORMULA FireWire-PT-03-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 108 transition count 290
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 107 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 107 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 106 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 106 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 105 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 104 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 14 place count 104 transition count 283
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 103 transition count 283
Applied a total of 16 rules in 42 ms. Remains 103 /112 variables (removed 9) and now considering 283/297 (removed 14) transitions.
[2025-06-02 05:51:32] [INFO ] Flow matrix only has 258 transitions (discarded 25 similar events)
// Phase 1: matrix 258 rows 103 cols
[2025-06-02 05:51:32] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:51:32] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 05:51:32] [INFO ] Flow matrix only has 258 transitions (discarded 25 similar events)
[2025-06-02 05:51:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:51:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 05:51:32] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:51:32] [INFO ] Redundant transitions in 27 ms returned []
Running 280 sub problems to find dead transitions.
[2025-06-02 05:51:32] [INFO ] Flow matrix only has 258 transitions (discarded 25 similar events)
[2025-06-02 05:51:32] [INFO ] Invariant cache hit.
[2025-06-02 05:51:32] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:34] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:34] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:34] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:34] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:35] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:35] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:35] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:36] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:43] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:51:51] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 14 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/360 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/361 variables, and 157 constraints, problems are : Problem set: 0 solved, 280 unsolved in 29912 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 257/360 variables, 103/121 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 280/437 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/361 variables, and 437 constraints, problems are : Problem set: 0 solved, 280 unsolved in 26482 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56508ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 56510ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/112 places, 283/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57029 ms. Remains : 103/112 places, 283/297 transitions.
[2025-06-02 05:52:29] [INFO ] Flatten gal took : 14 ms
[2025-06-02 05:52:29] [INFO ] Flatten gal took : 16 ms
[2025-06-02 05:52:29] [INFO ] Input system was already deterministic with 283 transitions.
[2025-06-02 05:52:29] [INFO ] Flatten gal took : 20 ms
[2025-06-02 05:52:29] [INFO ] Flatten gal took : 19 ms
[2025-06-02 05:52:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17144040792231840334.gal : 6 ms
[2025-06-02 05:52:29] [INFO ] Time to serialize properties into /tmp/CTLFireability513284975181579762.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/CTLFireability17144040792231840334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability513284975181579762.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,3.25068e+06,1.64538,35508,2,2835,5,92411,6,0,695,99627,0
Converting to forward existential form...Done !
original formula: EG(((((AG(((p5==0)||(p85==0))) + EF(((p8==0)||(p15==0)))) + ((p10==1)&&((p7==0)||(p73==0)))) * ((!(A(((p7==1)&&(p51==1)) U (p27==1))) + (...264
=> equivalent forward existential formula: [FwdG(Init,((((!(E(TRUE U !(((p5==0)||(p85==0))))) + E(TRUE U ((p8==0)||(p15==0)))) + ((p10==1)&&((p7==0)||(p73=...449
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...554
Detected timeout of ITS tools.
[2025-06-02 05:52:59] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:52:59] [INFO ] Applying decomposition
[2025-06-02 05:52:59] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14886209559422534561.txt' '-o' '/tmp/graph14886209559422534561.bin' '-w' '/tmp/graph14886209559422534561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14886209559422534561.bin' '-l' '-1' '-v' '-w' '/tmp/graph14886209559422534561.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:52:59] [INFO ] Decomposing Gal with order
[2025-06-02 05:52:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:52:59] [INFO ] Removed a total of 415 redundant transitions.
[2025-06-02 05:52:59] [INFO ] Flatten gal took : 89 ms
[2025-06-02 05:52:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 17 ms.
[2025-06-02 05:52:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10168783286594984447.gal : 5 ms
[2025-06-02 05:52:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11376817623563818705.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/CTLFireability10168783286594984447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11376817623563818705.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.25068e+06,6.38023,141984,1214,146,143198,2219,530,980275,90,21939,0
Converting to forward existential form...Done !
original formula: EG(((((AG(((i2.u7.p5==0)||(i7.u27.p85==0))) + EF(((i4.u3.p8==0)||(i4.u4.p15==0)))) + ((i4.u3.p10==1)&&((i3.u2.p7==0)||(i6.u24.p73==0)))) ...383
=> equivalent forward existential formula: [FwdG(Init,((((!(E(TRUE U !(((i2.u7.p5==0)||(i7.u27.p85==0))))) + E(TRUE U ((i4.u3.p8==0)||(i4.u4.p15==0)))) + (...606
Reverse transition relation is NOT exact ! Due to transitions t1, t43, t46, t49, t50, t59, t64, t69, t74, t79, t93, t95, t131, t140, t145, t147, t148, t149...692
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 292
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 290
Applied a total of 6 rules in 4 ms. Remains 109 /112 variables (removed 3) and now considering 290/297 (removed 7) transitions.
[2025-06-02 05:53:29] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 109 cols
[2025-06-02 05:53:29] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 05:53:30] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2025-06-02 05:53:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 05:53:30] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2025-06-02 05:53:30] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2025-06-02 05:53:30] [INFO ] Invariant cache hit.
[2025-06-02 05:53:30] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:33] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:33] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:33] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:34] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:34] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:34] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:35] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:53:35] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 166 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 289/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 290/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60564 ms. Remains : 109/112 places, 290/297 transitions.
[2025-06-02 05:54:30] [INFO ] Flatten gal took : 21 ms
[2025-06-02 05:54:30] [INFO ] Flatten gal took : 22 ms
[2025-06-02 05:54:30] [INFO ] Input system was already deterministic with 290 transitions.
[2025-06-02 05:54:30] [INFO ] Flatten gal took : 34 ms
[2025-06-02 05:54:30] [INFO ] Flatten gal took : 50 ms
[2025-06-02 05:54:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10676006564156697331.gal : 4 ms
[2025-06-02 05:54:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6189014320918503966.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/CTLFireability10676006564156697331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6189014320918503966.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,5.7602e+06,1.82911,38700,2,3567,5,99997,6,0,723,112627,0
Converting to forward existential form...Done !
original formula: (EG(AF(EX(((p2==1)&&(p92==1))))) + E((((p5==1)&&(p75==1)) * ((A(!(((p109==1)&&(p110==1))) U AX(((p2==1)&&(p98==1)))) + ((p7==1)&&(p71==1)...382
=> equivalent forward existential formula: ([FwdG(Init,!(EG(!(EX(((p2==1)&&(p92==1)))))))] != FALSE + ([((FwdU(Init,(((p5==1)&&(p75==1)) * ((!((E(!(!(EX(!(...878
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...590
Detected timeout of ITS tools.
[2025-06-02 05:55:00] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:55:00] [INFO ] Applying decomposition
[2025-06-02 05:55:00] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6816006323815914876.txt' '-o' '/tmp/graph6816006323815914876.bin' '-w' '/tmp/graph6816006323815914876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6816006323815914876.bin' '-l' '-1' '-v' '-w' '/tmp/graph6816006323815914876.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:55:00] [INFO ] Decomposing Gal with order
[2025-06-02 05:55:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:55:00] [INFO ] Removed a total of 417 redundant transitions.
[2025-06-02 05:55:00] [INFO ] Flatten gal took : 28 ms
[2025-06-02 05:55:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 13 ms.
[2025-06-02 05:55:00] [INFO ] Time to serialize gal into /tmp/CTLFireability6521173667114999466.gal : 5 ms
[2025-06-02 05:55:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2972470407883001578.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/CTLFireability6521173667114999466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2972470407883001578.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 102 transition count 278
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 101 transition count 278
Applied a total of 20 rules in 40 ms. Remains 101 /112 variables (removed 11) and now considering 278/297 (removed 19) transitions.
[2025-06-02 05:55:31] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
// Phase 1: matrix 253 rows 101 cols
[2025-06-02 05:55:31] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:55:31] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 05:55:31] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2025-06-02 05:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:55:31] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 05:55:31] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:55:31] [INFO ] Redundant transitions in 6 ms returned []
Running 275 sub problems to find dead transitions.
[2025-06-02 05:55:31] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2025-06-02 05:55:31] [INFO ] Invariant cache hit.
[2025-06-02 05:55:31] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:33] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:33] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:33] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:33] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:34] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:34] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:34] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 151 constraints, problems are : Problem set: 0 solved, 275 unsolved in 22972 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/354 variables, and 426 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53102ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 53103ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/112 places, 278/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53556 ms. Remains : 101/112 places, 278/297 transitions.
[2025-06-02 05:56:24] [INFO ] Flatten gal took : 16 ms
[2025-06-02 05:56:24] [INFO ] Flatten gal took : 20 ms
[2025-06-02 05:56:24] [INFO ] Input system was already deterministic with 278 transitions.
[2025-06-02 05:56:24] [INFO ] Flatten gal took : 16 ms
[2025-06-02 05:56:24] [INFO ] Flatten gal took : 15 ms
[2025-06-02 05:56:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4834938835805879830.gal : 5 ms
[2025-06-02 05:56:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11848417181206433679.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/CTLFireability4834938835805879830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11848417181206433679.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07891e+06,1.61125,33876,2,2732,5,88705,6,0,682,95997,0
Converting to forward existential form...Done !
original formula: AG(EF((((p7==1)&&(p32==1))&&(p76==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p7==1)&&(p32==1))&&(p76==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...542
(forward)formula 0,0,29.3858,515040,1,0,542,2.52284e+06,574,293,5673,2.00633e+06,661
FORMULA FireWire-PT-03-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 296
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 296
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 108 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 108 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 106 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 104 transition count 280
Applied a total of 18 rules in 23 ms. Remains 104 /112 variables (removed 8) and now considering 280/297 (removed 17) transitions.
[2025-06-02 05:56:54] [INFO ] Flow matrix only has 255 transitions (discarded 25 similar events)
// Phase 1: matrix 255 rows 104 cols
[2025-06-02 05:56:54] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:56:54] [INFO ] Implicit Places using invariants in 101 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 103/112 places, 280/297 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 279
Applied a total of 2 rules in 13 ms. Remains 102 /103 variables (removed 1) and now considering 279/280 (removed 1) transitions.
[2025-06-02 05:56:54] [INFO ] Flow matrix only has 254 transitions (discarded 25 similar events)
// Phase 1: matrix 254 rows 102 cols
[2025-06-02 05:56:54] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:56:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 05:56:54] [INFO ] Flow matrix only has 254 transitions (discarded 25 similar events)
[2025-06-02 05:56:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:56:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 05:56:54] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/112 places, 279/297 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 476 ms. Remains : 102/112 places, 279/297 transitions.
[2025-06-02 05:56:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:56:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:56:54] [INFO ] Input system was already deterministic with 279 transitions.
[2025-06-02 05:56:54] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:56:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:56:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8958822894310620862.gal : 2 ms
[2025-06-02 05:56:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17775354198581123591.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/CTLFireability8958822894310620862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17775354198581123591.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07891e+06,1.75416,40376,2,3095,5,103575,6,0,686,116427,0
Converting to forward existential form...Done !
original formula: AF(AG(((p70==0)||(p104==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p70==0)||(p104==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...542
Detected timeout of ITS tools.
[2025-06-02 05:57:24] [INFO ] Flatten gal took : 13 ms
[2025-06-02 05:57:24] [INFO ] Applying decomposition
[2025-06-02 05:57:24] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17055762699521003757.txt' '-o' '/tmp/graph17055762699521003757.bin' '-w' '/tmp/graph17055762699521003757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17055762699521003757.bin' '-l' '-1' '-v' '-w' '/tmp/graph17055762699521003757.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:57:25] [INFO ] Decomposing Gal with order
[2025-06-02 05:57:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:57:25] [INFO ] Removed a total of 404 redundant transitions.
[2025-06-02 05:57:25] [INFO ] Flatten gal took : 32 ms
[2025-06-02 05:57:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 15 ms.
[2025-06-02 05:57:25] [INFO ] Time to serialize gal into /tmp/CTLFireability10758645396740461582.gal : 5 ms
[2025-06-02 05:57:25] [INFO ] Time to serialize properties into /tmp/CTLFireability12702645021510481993.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/CTLFireability10758645396740461582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12702645021510481993.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07891e+06,5.26019,136788,1663,141,170887,1956,542,973924,89,15556,0
Converting to forward existential form...Done !
original formula: AF(AG(((i5.u22.p70==0)||(i7.u33.p104==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((i5.u22.p70==0)||(i7.u33.p104==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t43, t49, t50, t59, t64, t69, t74, t79, t93, t95, t96, t97, t98, t131, t140, t145, t158, ...694
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 5 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
[2025-06-02 05:57:55] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2025-06-02 05:57:55] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:57:55] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-02 05:57:55] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 05:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:57:55] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 05:57:56] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-02 05:57:56] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 05:57:56] [INFO ] Invariant cache hit.
[2025-06-02 05:57:56] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:59] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:59] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:00] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:00] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:00] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:00] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:01] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:58:01] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 164 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/449 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 450 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 287/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61084 ms. Remains : 108/112 places, 287/297 transitions.
[2025-06-02 05:58:56] [INFO ] Flatten gal took : 13 ms
[2025-06-02 05:58:56] [INFO ] Flatten gal took : 13 ms
[2025-06-02 05:58:56] [INFO ] Input system was already deterministic with 287 transitions.
[2025-06-02 05:58:56] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:58:56] [INFO ] Flatten gal took : 13 ms
[2025-06-02 05:58:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9051142267902784720.gal : 4 ms
[2025-06-02 05:58:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5959226253549588527.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/CTLFireability9051142267902784720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5959226253549588527.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,5.60248e+06,1.92151,41980,2,3598,5,107671,6,0,716,121327,0
Converting to forward existential form...Done !
original formula: AF(((p78==0) * AG(!(A(AX(((p45==1)&&(p58==1))) U A(((p3==1)&&(p37==1)) U (p74==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((p78==0) * !(E(TRUE U !(!(!((E(!(!((E(!((p74==1)) U (!(((p3==1)&&(p37==1))) * !((p74==1)))) + EG(!...398
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2025-06-02 05:59:26] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:59:26] [INFO ] Applying decomposition
[2025-06-02 05:59:26] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6009631297189785792.txt' '-o' '/tmp/graph6009631297189785792.bin' '-w' '/tmp/graph6009631297189785792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6009631297189785792.bin' '-l' '-1' '-v' '-w' '/tmp/graph6009631297189785792.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:59:26] [INFO ] Decomposing Gal with order
[2025-06-02 05:59:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:59:26] [INFO ] Removed a total of 409 redundant transitions.
[2025-06-02 05:59:26] [INFO ] Flatten gal took : 25 ms
[2025-06-02 05:59:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 7 ms.
[2025-06-02 05:59:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11338521391452750676.gal : 3 ms
[2025-06-02 05:59:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12389807846174852789.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/CTLFireability11338521391452750676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12389807846174852789.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,5.60248e+06,24.1968,452440,2522,176,527167,2174,537,3.10235e+06,104,23756,0
Converting to forward existential form...Done !
original formula: AF(((i4.u24.p78==0) * AG(!(A(AX(((i3.u13.p45==1)&&(i3.u17.p58==1))) U A(((i1.u1.p3==1)&&(i1.u10.p37==1)) U (i5.u32.p74==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((i4.u24.p78==0) * !(E(TRUE U !(!(!((E(!(!((E(!((i5.u32.p74==1)) U (!(((i1.u1.p3==1)&&(i1.u10.p37==...521
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t96, t99, t138, t148, t153, t155, t156,...750
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2025-06-02 05:59:56] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2025-06-02 05:59:56] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:59:56] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 05:59:56] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 05:59:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:59:56] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 05:59:56] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2025-06-02 05:59:56] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 05:59:56] [INFO ] Invariant cache hit.
[2025-06-02 05:59:56] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:00] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:00] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:01] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:01] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:01] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:01] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:00:02] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 163 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 284/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60406 ms. Remains : 107/112 places, 285/297 transitions.
[2025-06-02 06:00:56] [INFO ] Flatten gal took : 8 ms
[2025-06-02 06:00:57] [INFO ] Flatten gal took : 8 ms
[2025-06-02 06:00:57] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 06:00:57] [INFO ] Flatten gal took : 8 ms
[2025-06-02 06:00:57] [INFO ] Flatten gal took : 7 ms
[2025-06-02 06:00:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14748665387173861527.gal : 2 ms
[2025-06-02 06:00:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13695291699464797975.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/CTLFireability14748665387173861527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13695291699464797975.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,5.45564e+06,3.25814,76680,2,4437,5,220184,6,0,710,221203,0
Converting to forward existential form...Done !
original formula: EG((E(!((E(((p8==1)&&(p61==1)) U ((p2==1)&&(p38==1))) * AF(((p10==1)&&(p18==1))))) U (((AG(((p2==1)&&(p92==1))) * AF(((p7==1)&&(p56==1)))...403
=> equivalent forward existential formula: [FwdG(Init,(E(!((E(((p8==1)&&(p61==1)) U ((p2==1)&&(p38==1))) * !(EG(!(((p10==1)&&(p18==1))))))) U (((!(E(TRUE U...488
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2025-06-02 06:01:27] [INFO ] Flatten gal took : 8 ms
[2025-06-02 06:01:27] [INFO ] Applying decomposition
[2025-06-02 06:01:27] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14780009347355071349.txt' '-o' '/tmp/graph14780009347355071349.bin' '-w' '/tmp/graph14780009347355071349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14780009347355071349.bin' '-l' '-1' '-v' '-w' '/tmp/graph14780009347355071349.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:01:27] [INFO ] Decomposing Gal with order
[2025-06-02 06:01:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:01:27] [INFO ] Removed a total of 405 redundant transitions.
[2025-06-02 06:01:27] [INFO ] Flatten gal took : 24 ms
[2025-06-02 06:01:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 5 ms.
[2025-06-02 06:01:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8495412883248653859.gal : 3 ms
[2025-06-02 06:01:27] [INFO ] Time to serialize properties into /tmp/CTLFireability7833669155745008429.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/CTLFireability8495412883248653859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7833669155745008429.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,5.45564e+06,3.77308,95188,1372,211,152491,2308,611,470485,104,18421,0
Converting to forward existential form...Done !
original formula: EG((E(!((E(((i0.i0.u3.p8==1)&&(i4.u24.p61==1)) U ((i3.u0.p2==1)&&(i0.i1.u10.p38==1))) * AF(((i0.i0.u3.p10==1)&&(i0.i0.u5.p18==1))))) U ((...617
=> equivalent forward existential formula: [FwdG(Init,(E(!((E(((i0.i0.u3.p8==1)&&(i4.u24.p61==1)) U ((i3.u0.p2==1)&&(i0.i1.u10.p38==1))) * !(EG(!(((i0.i0.u...702
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t139, t148, t153, t155, t156,...760
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,19.8545,443408,1,0,653869,7028,3335,2.63443e+06,524,36359,960528
FORMULA FireWire-PT-03-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 102 transition count 278
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 101 transition count 278
Applied a total of 20 rules in 26 ms. Remains 101 /112 variables (removed 11) and now considering 278/297 (removed 19) transitions.
[2025-06-02 06:01:47] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
// Phase 1: matrix 253 rows 101 cols
[2025-06-02 06:01:47] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-02 06:01:47] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2025-06-02 06:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:47] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 06:01:47] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:01:47] [INFO ] Redundant transitions in 6 ms returned []
Running 275 sub problems to find dead transitions.
[2025-06-02 06:01:47] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2025-06-02 06:01:47] [INFO ] Invariant cache hit.
[2025-06-02 06:01:47] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:49] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:49] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:49] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:50] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:50] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:01:51] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 151 constraints, problems are : Problem set: 0 solved, 275 unsolved in 22537 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/354 variables, and 426 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52642ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 52643ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/112 places, 278/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53119 ms. Remains : 101/112 places, 278/297 transitions.
[2025-06-02 06:02:40] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:02:40] [INFO ] Flatten gal took : 7 ms
[2025-06-02 06:02:40] [INFO ] Input system was already deterministic with 278 transitions.
[2025-06-02 06:02:40] [INFO ] Flatten gal took : 12 ms
[2025-06-02 06:02:40] [INFO ] Flatten gal took : 11 ms
[2025-06-02 06:02:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15013846579923629771.gal : 3 ms
[2025-06-02 06:02:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12157130823616328013.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/ReachabilityCardinality15013846579923629771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12157130823616328013.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (2428 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (74 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Finished probabilistic random walk after 4330 steps, run visited all 1 properties in 53 ms. (steps per millisecond=81 )
Probabilistic random walk after 4330 steps, saw 1999 distinct states, run finished after 53 ms. (steps per millisecond=81 ) properties seen :1
FORMULA FireWire-PT-03-CTLFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 292
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 290
Applied a total of 6 rules in 3 ms. Remains 109 /112 variables (removed 3) and now considering 290/297 (removed 7) transitions.
[2025-06-02 06:02:40] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 109 cols
[2025-06-02 06:02:40] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:40] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 06:02:40] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2025-06-02 06:02:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:02:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 06:02:40] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2025-06-02 06:02:40] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2025-06-02 06:02:40] [INFO ] Invariant cache hit.
[2025-06-02 06:02:40] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:44] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:44] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:44] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:45] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:45] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:45] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:45] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 166 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 289/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 290/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60549 ms. Remains : 109/112 places, 290/297 transitions.
[2025-06-02 06:03:41] [INFO ] Flatten gal took : 10 ms
[2025-06-02 06:03:41] [INFO ] Flatten gal took : 10 ms
[2025-06-02 06:03:41] [INFO ] Input system was already deterministic with 290 transitions.
[2025-06-02 06:03:41] [INFO ] Flatten gal took : 10 ms
[2025-06-02 06:03:41] [INFO ] Flatten gal took : 10 ms
[2025-06-02 06:03:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1564920476428889810.gal : 2 ms
[2025-06-02 06:03:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8485152435395733290.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/CTLFireability1564920476428889810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8485152435395733290.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,5.7602e+06,1.67975,38660,2,3567,5,99997,6,0,723,112627,0
Converting to forward existential form...Done !
original formula: ((EF(AG((((((p8==1)&&(p59==1))||(p71==1)) * AG(((p2==1)&&(p36==1)))) + (p103==1)))) + EG((AX(((p7==1)&&(p86==1))) * EF(((p10==1)&&(p68==1...188
=> equivalent forward existential formula: [(EY((Init * !((E(TRUE U !(E(TRUE U !((((((p8==1)&&(p59==1))||(p71==1)) * !(E(TRUE U !(((p2==1)&&(p36==1)))))) +...280
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...590
Using saturation style SCC detection
(forward)formula 0,0,15.1561,324648,1,0,615,1.57537e+06,614,335,6284,1.29846e+06,753
FORMULA FireWire-PT-03-CTLFireability-2025-10 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 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 102 transition count 278
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 101 transition count 278
Applied a total of 20 rules in 24 ms. Remains 101 /112 variables (removed 11) and now considering 278/297 (removed 19) transitions.
[2025-06-02 06:03:56] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
// Phase 1: matrix 253 rows 101 cols
[2025-06-02 06:03:56] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:56] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 06:03:56] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2025-06-02 06:03:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 06:03:56] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:03:56] [INFO ] Redundant transitions in 2 ms returned []
Running 275 sub problems to find dead transitions.
[2025-06-02 06:03:56] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2025-06-02 06:03:56] [INFO ] Invariant cache hit.
[2025-06-02 06:03:56] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:58] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:58] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:58] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:59] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:59] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:03:59] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:04:00] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 151 constraints, problems are : Problem set: 0 solved, 275 unsolved in 24109 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/151 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/354 variables, and 426 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54232ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 54235ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/112 places, 278/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54594 ms. Remains : 101/112 places, 278/297 transitions.
[2025-06-02 06:04:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 06:04:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 06:04:51] [INFO ] Input system was already deterministic with 278 transitions.
[2025-06-02 06:04:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 06:04:51] [INFO ] Flatten gal took : 11 ms
[2025-06-02 06:04:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11975586942471196720.gal : 3 ms
[2025-06-02 06:04:51] [INFO ] Time to serialize properties into /tmp/CTLFireability657777804911112733.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/CTLFireability11975586942471196720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability657777804911112733.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,3.07891e+06,1.55479,33904,2,2732,5,88705,6,0,682,95997,0
Converting to forward existential form...Done !
original formula: EF(AG(AF(((p87==1)&&(p105==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((p87==1)&&(p105==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...542
Detected timeout of ITS tools.
[2025-06-02 06:05:21] [INFO ] Flatten gal took : 12 ms
[2025-06-02 06:05:21] [INFO ] Applying decomposition
[2025-06-02 06:05:21] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17629685862163248003.txt' '-o' '/tmp/graph17629685862163248003.bin' '-w' '/tmp/graph17629685862163248003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17629685862163248003.bin' '-l' '-1' '-v' '-w' '/tmp/graph17629685862163248003.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:05:21] [INFO ] Decomposing Gal with order
[2025-06-02 06:05:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:05:21] [INFO ] Removed a total of 406 redundant transitions.
[2025-06-02 06:05:21] [INFO ] Flatten gal took : 30 ms
[2025-06-02 06:05:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 6 ms.
[2025-06-02 06:05:21] [INFO ] Time to serialize gal into /tmp/CTLFireability16572234227166501589.gal : 4 ms
[2025-06-02 06:05:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7913779965086528526.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/CTLFireability16572234227166501589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7913779965086528526.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07891e+06,12.6169,314772,2054,139,258339,2382,509,2.74286e+06,85,25197,0
Converting to forward existential form...Done !
original formula: EF(AG(AF(((i0.u28.p87==1)&&(i7.u35.p105==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((i0.u28.p87==1)&&(i7.u35.p105==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t43, t49, t50, t59, t64, t69, t74, t79, t93, t95, t131, t140, t145, t147, t148, t149, t15...680
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,28.3394,493208,1,0,410601,4354,2670,4.49375e+06,382,25197,679848
FORMULA FireWire-PT-03-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 291
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 5 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
[2025-06-02 06:05:49] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2025-06-02 06:05:49] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:49] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-02 06:05:49] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 06:05:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:50] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 06:05:50] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-02 06:05:50] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 06:05:50] [INFO ] Invariant cache hit.
[2025-06-02 06:05:50] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:54] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:54] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:54] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:54] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:55] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:55] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:56] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:05:56] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/369 variables, and 164 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/449 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 450 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 287/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60583 ms. Remains : 108/112 places, 287/297 transitions.
[2025-06-02 06:06:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 06:06:50] [INFO ] Flatten gal took : 8 ms
[2025-06-02 06:06:50] [INFO ] Input system was already deterministic with 287 transitions.
[2025-06-02 06:06:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 06:06:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 06:06:50] [INFO ] Time to serialize gal into /tmp/CTLFireability13101271423864773683.gal : 1 ms
[2025-06-02 06:06:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16735527869516124009.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/CTLFireability13101271423864773683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16735527869516124009.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,5.5677e+06,1.46576,37172,2,3455,5,97647,6,0,716,108289,0
Converting to forward existential form...Done !
original formula: AF(EX(E(((!(((p7==1)&&(p33==1))) + AX((p83==1))) + E(((p7==1)&&(p33==1)) U ((p7==1)&&(p23==1)))) U (EF(((p7==1)&&(p85==1))) * E(((p8==1)&...193
=> equivalent forward existential formula: [FwdG(Init,!(EX(E(((!(((p7==1)&&(p33==1))) + !(EX(!((p83==1))))) + E(((p7==1)&&(p33==1)) U ((p7==1)&&(p23==1))))...250
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t7, t8, t12, t13, t15, t20, t21, t22, t23, t24, t26, t28, t33, t34, t35, ...587
(forward)formula 0,1,22.1017,487592,1,0,793,2.7834e+06,614,452,6026,2.42464e+06,879
FORMULA FireWire-PT-03-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2025-06-02 06:07:12] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2025-06-02 06:07:12] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:07:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 06:07:12] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 06:07:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:07:12] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 06:07:12] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2025-06-02 06:07:12] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 06:07:12] [INFO ] Invariant cache hit.
[2025-06-02 06:07:12] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:16] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:16] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:17] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:17] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:17] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:17] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:18] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:18] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 163 constraints, problems are : Problem set: 0 solved, 284 unsolved in 29997 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 284/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60398 ms. Remains : 107/112 places, 285/297 transitions.
[2025-06-02 06:08:13] [INFO ] Flatten gal took : 12 ms
[2025-06-02 06:08:13] [INFO ] Flatten gal took : 12 ms
[2025-06-02 06:08:13] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 06:08:13] [INFO ] Flatten gal took : 12 ms
[2025-06-02 06:08:13] [INFO ] Flatten gal took : 12 ms
[2025-06-02 06:08:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17444255719416024289.gal : 3 ms
[2025-06-02 06:08:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5339412076593720249.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/CTLFireability17444255719416024289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5339412076593720249.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,5.45564e+06,3.44042,76784,2,4437,5,220184,6,0,710,221203,0
Converting to forward existential form...Done !
original formula: (AF(AX((((p5==0)||(p48==0)) * AG(((p10==0)||(p18==0)))))) * EF(((p7==1)&&(p72==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!((((p5==0)||(p48==0)) * !(E(TRUE U !(((p10==0)||(p18==0)))))))))))] = FALSE * [(Init * !(E(T...193
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2025-06-02 06:08:43] [INFO ] Flatten gal took : 7 ms
[2025-06-02 06:08:43] [INFO ] Applying decomposition
[2025-06-02 06:08:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12601636911625302298.txt' '-o' '/tmp/graph12601636911625302298.bin' '-w' '/tmp/graph12601636911625302298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12601636911625302298.bin' '-l' '-1' '-v' '-w' '/tmp/graph12601636911625302298.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:08:43] [INFO ] Decomposing Gal with order
[2025-06-02 06:08:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:08:43] [INFO ] Removed a total of 414 redundant transitions.
[2025-06-02 06:08:43] [INFO ] Flatten gal took : 17 ms
[2025-06-02 06:08:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 4 ms.
[2025-06-02 06:08:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6187098747986662674.gal : 3 ms
[2025-06-02 06:08:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8627889628057823557.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/CTLFireability6187098747986662674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8627889628057823557.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,5.45564e+06,5.25252,138296,1482,197,199465,3012,591,873420,89,24628,0
Converting to forward existential form...Done !
original formula: (AF(AX((((i1.u7.p5==0)||(i2.u15.p48==0)) * AG(((i0.i0.u3.p10==0)||(i0.i1.u5.p18==0)))))) * EF(((i2.u2.p7==1)&&(i4.u24.p72==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!((((i1.u7.p5==0)||(i2.u15.p48==0)) * !(E(TRUE U !(((i0.i0.u3.p10==0)||(i0.i1.u5.p18==0))))))...237
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t100, t101, t102, t139, t148,...772
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 4 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2025-06-02 06:09:13] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 06:09:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:09:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 06:09:13] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 06:09:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:09:13] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 06:09:13] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2025-06-02 06:09:13] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 06:09:13] [INFO ] Invariant cache hit.
[2025-06-02 06:09:13] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:16] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:16] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:16] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:16] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:16] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:16] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:17] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:17] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 163 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/124 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 284/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 447 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60450 ms. Remains : 107/112 places, 285/297 transitions.
[2025-06-02 06:10:13] [INFO ] Flatten gal took : 11 ms
[2025-06-02 06:10:13] [INFO ] Flatten gal took : 13 ms
[2025-06-02 06:10:13] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 06:10:13] [INFO ] Flatten gal took : 11 ms
[2025-06-02 06:10:13] [INFO ] Flatten gal took : 11 ms
[2025-06-02 06:10:13] [INFO ] Time to serialize gal into /tmp/CTLFireability444921068737492773.gal : 2 ms
[2025-06-02 06:10:13] [INFO ] Time to serialize properties into /tmp/CTLFireability9845217378280180013.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/CTLFireability444921068737492773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9845217378280180013.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,5.45564e+06,3.46666,76664,2,4437,5,220184,6,0,710,221203,0
Converting to forward existential form...Done !
original formula: AG((A(AG(AX(((p7==1)&&(p24==1)))) U ((EX(((p7==1)&&(p23==1))) + EF(((p7==1)&&(p46==1)))) + AX((((p7==1)&&(p48==1))&&((p7==1)&&(p75==1))))...185
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!((E(!(((EX(((p7==1)&&(p23==1))) + E(TRUE U ((p7==1)&&(p46==1)))) + !(EX(!((((p7==1)&...527
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 231/0/54
(forward)formula 0,0,26.8248,562964,1,0,639,2.79632e+06,610,346,6362,2.51936e+06,738
FORMULA FireWire-PT-03-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-02 06:10:40] [INFO ] Flatten gal took : 8 ms
[2025-06-02 06:10:40] [INFO ] Flatten gal took : 8 ms
[2025-06-02 06:10:40] [INFO ] Applying decomposition
[2025-06-02 06:10:40] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5737100570945152214.txt' '-o' '/tmp/graph5737100570945152214.bin' '-w' '/tmp/graph5737100570945152214.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5737100570945152214.bin' '-l' '-1' '-v' '-w' '/tmp/graph5737100570945152214.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:10:40] [INFO ] Decomposing Gal with order
[2025-06-02 06:10:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:10:40] [INFO ] Removed a total of 433 redundant transitions.
[2025-06-02 06:10:40] [INFO ] Flatten gal took : 19 ms
[2025-06-02 06:10:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 4 ms.
[2025-06-02 06:10:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1807005309747409092.gal : 3 ms
[2025-06-02 06:10:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10249759367624223552.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/CTLFireability1807005309747409092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10249759367624223552.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 5 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,6.20421e+06,86.9033,1733484,2630,175,870061,14672,599,1.92182e+07,89,155906,0
Converting to forward existential form...Done !
original formula: EG(((((AG(((i0.u7.p5==0)||(i5.u28.p85==0))) + EF(((i6.i1.u3.p8==0)||(i6.i0.u4.p15==0)))) + ((i6.i1.u3.p10==1)&&((i5.u2.p7==0)||(i4.u24.p7...395
=> equivalent forward existential formula: [FwdG(Init,((((!(E(TRUE U !(((i0.u7.p5==0)||(i5.u28.p85==0))))) + E(TRUE U ((i6.i1.u3.p8==0)||(i6.i0.u4.p15==0))...618
Reverse transition relation is NOT exact ! Due to transitions t4, t49, t51, t55, t56, t64, t65, t70, t75, t80, t85, t99, t101, t102, t103, t104, t141, t150...804
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,235.787,2201452,1,0,1.47598e+06,14672,1666,2.22755e+07,226,155906,427481
FORMULA FireWire-PT-03-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EG(AF(EX(((i1.u0.p2==1)&&(i1.u31.p92==1))))) + E((((i0.u7.p5==1)&&(i4.u25.p75==1)) * ((A(!(((i3.i1.u35.p109==1)&&(i3.i1.u36.p110==1))) U...568
=> equivalent forward existential formula: ([FwdG(Init,!(EG(!(EX(((i1.u0.p2==1)&&(i1.u31.p92==1)))))))] != FALSE + ([((FwdU(Init,(((i0.u7.p5==1)&&(i4.u25.p...1230
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 1,1,409.725,2428268,1,0,1.47598e+06,14672,1885,2.56308e+07,237,155906,669859
FORMULA FireWire-PT-03-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AF(AG(((i4.u23.p70==0)||(i3.i0.u34.p104==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((i4.u23.p70==0)||(i3.i0.u34.p104==0)))))))] = FALSE
(forward)formula 2,0,672.822,2686844,1,0,1.49691e+06,14672,1378,3.1307e+07,201,155906,1407159
FORMULA FireWire-PT-03-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF(((i5.u26.p78==0) * AG(!(A(AX(((i2.u14.p45==1)&&(i2.u18.p58==1))) U A(((i6.i0.u1.p3==1)&&(i6.i1.u11.p37==1)) U (i4.u25.p74==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((i5.u26.p78==0) * !(E(TRUE U !(!(!((E(!(!((E(!((i4.u25.p74==1)) U (!(((i6.i0.u1.p3==1)&&(i6.i1.u11...539
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 3,0,1080.4,3454332,1,0,1.93394e+06,14672,1378,3.98065e+07,201,155906,1823259
FORMULA FireWire-PT-03-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (AF(AX((((i0.u7.p5==0)||(i2.u15.p48==0)) * AG(((i6.i1.u3.p10==0)||(i6.i0.u5.p18==0)))))) * EF(((i5.u2.p7==1)&&(i4.u24.p72==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!((((i0.u7.p5==0)||(i2.u15.p48==0)) * !(E(TRUE U !(((i6.i1.u3.p10==0)||(i6.i0.u5.p18==0))))))...237
(forward)formula 4,0,1536.85,4229500,1,0,2.10233e+06,14672,1378,4.83367e+07,201,155906,1199763
FORMULA FireWire-PT-03-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Total runtime 2916553 ms.
BK_STOP 1748846180410
--------------------
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="FireWire-PT-03"
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 FireWire-PT-03, 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 r086-smll-174860102200258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-03.tgz
mv FireWire-PT-03 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;