Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K 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 175K 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 MedleyA-PT-17-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-17-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748871495804

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 13:38:18] [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 13:38:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:38:18] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2025-06-02 13:38:18] [INFO ] Transformed 248 places.
[2025-06-02 13:38:18] [INFO ] Transformed 591 transitions.
[2025-06-02 13:38:18] [INFO ] Found NUPN structural information;
[2025-06-02 13:38:18] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 102 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 213 transition count 531
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 213 transition count 531
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 87 place count 213 transition count 514
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 212 transition count 512
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 212 transition count 512
Applied a total of 89 rules in 83 ms. Remains 212 /248 variables (removed 36) and now considering 512/589 (removed 77) transitions.
// Phase 1: matrix 512 rows 212 cols
[2025-06-02 13:38:19] [INFO ] Computed 7 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:38:19] [INFO ] Implicit Places using invariants in 421 ms returned []
[2025-06-02 13:38:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:38:20] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Running 511 sub problems to find dead transitions.
[2025-06-02 13:38:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:31] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:32] [INFO ] Deduced a trap composed of 15 places in 461 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:32] [INFO ] Deduced a trap composed of 16 places in 459 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:33] [INFO ] Deduced a trap composed of 16 places in 341 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:33] [INFO ] Deduced a trap composed of 16 places in 291 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:33] [INFO ] Deduced a trap composed of 16 places in 313 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:33] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:34] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:34] [INFO ] Deduced a trap composed of 18 places in 348 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:35] [INFO ] Deduced a trap composed of 18 places in 356 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:35] [INFO ] Deduced a trap composed of 19 places in 365 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:35] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:36] [INFO ] Deduced a trap composed of 124 places in 209 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:36] [INFO ] Deduced a trap composed of 124 places in 230 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:36] [INFO ] Deduced a trap composed of 124 places in 205 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:36] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:37] [INFO ] Deduced a trap composed of 24 places in 340 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:38] [INFO ] Deduced a trap composed of 136 places in 255 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:39] [INFO ] Deduced a trap composed of 25 places in 364 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:39] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:39] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:41] [INFO ] Deduced a trap composed of 25 places in 316 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:41] [INFO ] Deduced a trap composed of 22 places in 303 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:42] [INFO ] Deduced a trap composed of 41 places in 338 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:42] [INFO ] Deduced a trap composed of 36 places in 326 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:43] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:43] [INFO ] Deduced a trap composed of 39 places in 339 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:43] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:44] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:44] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:44] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:45] [INFO ] Deduced a trap composed of 24 places in 359 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:45] [INFO ] Deduced a trap composed of 25 places in 356 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:46] [INFO ] Deduced a trap composed of 24 places in 339 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:46] [INFO ] Deduced a trap composed of 95 places in 320 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:46] [INFO ] Deduced a trap composed of 98 places in 305 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:47] [INFO ] Deduced a trap composed of 22 places in 363 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:47] [INFO ] Deduced a trap composed of 25 places in 358 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:48] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:48] [INFO ] Deduced a trap composed of 27 places in 315 ms of which 34 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 212/724 variables, and 47 constraints, problems are : Problem set: 0 solved, 511 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/212 constraints, PredecessorRefiner: 511/511 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:54] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:55] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:55] [INFO ] Deduced a trap composed of 41 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 13:38:56] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:56] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:56] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:57] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:58] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:59] [INFO ] Deduced a trap composed of 122 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:59] [INFO ] Deduced a trap composed of 127 places in 195 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:00] [INFO ] Deduced a trap composed of 121 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:01] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:01] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:01] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:01] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:02] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:02] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:05] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:06] [INFO ] Deduced a trap composed of 129 places in 215 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:06] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:10] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:10] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:14] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:15] [INFO ] Deduced a trap composed of 121 places in 198 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:15] [INFO ] Deduced a trap composed of 95 places in 242 ms of which 39 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:18] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:19] [INFO ] Deduced a trap composed of 126 places in 293 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:19] [INFO ] Deduced a trap composed of 127 places in 209 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:20] [INFO ] Deduced a trap composed of 126 places in 330 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:21] [INFO ] Deduced a trap composed of 126 places in 338 ms of which 41 ms to minimize.
SMT process timed out in 60882ms, After SMT, problems are : Problem set: 0 solved, 511 unsolved
Search for dead transitions found 0 dead transitions in 60922ms
Starting structural reductions in LTL mode, iteration 1 : 212/248 places, 512/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62118 ms. Remains : 212/248 places, 512/589 transitions.
Support contains 102 out of 212 places after structural reductions.
[2025-06-02 13:39:21] [INFO ] Flatten gal took : 188 ms
[2025-06-02 13:39:21] [INFO ] Flatten gal took : 115 ms
[2025-06-02 13:39:22] [INFO ] Input system was already deterministic with 512 transitions.
Reduction of identical properties reduced properties to check from 88 to 87
RANDOM walk for 40000 steps (1376 resets) in 2053 ms. (19 steps per ms) remains 82/87 properties
BEST_FIRST walk for 4001 steps (28 resets) in 41 ms. (95 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (29 resets) in 29 ms. (133 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 42 ms. (93 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 56 ms. (70 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (28 resets) in 41 ms. (95 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (29 resets) in 19 ms. (200 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 38 ms. (102 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 42 ms. (93 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (28 resets) in 21 ms. (181 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (23 resets) in 20 ms. (190 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4001 steps (28 resets) in 56 ms. (70 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (29 resets) in 35 ms. (111 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4001 steps (29 resets) in 22 ms. (173 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4001 steps (28 resets) in 17 ms. (222 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (29 resets) in 37 ms. (105 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (29 resets) in 31 ms. (125 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 32 ms. (121 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 34 ms. (114 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 26 ms. (148 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 31 ms. (125 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 32 ms. (121 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (25 resets) in 29 ms. (133 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (29 resets) in 31 ms. (125 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 30 ms. (129 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 29 ms. (133 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (27 resets) in 26 ms. (148 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 29 ms. (133 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (28 resets) in 25 ms. (153 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (27 resets) in 27 ms. (143 steps per ms) remains 80/82 properties
BEST_FIRST walk for 4003 steps (28 resets) in 33 ms. (117 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (24 resets) in 31 ms. (125 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (29 resets) in 28 ms. (138 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (29 resets) in 21 ms. (181 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (29 resets) in 29 ms. (133 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (28 resets) in 30 ms. (129 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 31 ms. (125 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (29 resets) in 26 ms. (148 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (29 resets) in 27 ms. (143 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (29 resets) in 26 ms. (148 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (29 resets) in 28 ms. (138 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (29 resets) in 27 ms. (142 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (29 resets) in 20 ms. (190 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 31 ms. (125 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 30 ms. (129 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (29 resets) in 24 ms. (160 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (29 resets) in 27 ms. (143 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 33 ms. (117 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 28 ms. (138 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (31 resets) in 31 ms. (125 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (29 resets) in 26 ms. (148 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (28 resets) in 31 ms. (125 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (28 resets) in 29 ms. (133 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 80/80 properties
Interrupted probabilistic random walk after 329192 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :30 out of 80
Probabilistic random walk after 329192 steps, saw 61220 distinct states, run finished after 3007 ms. (steps per millisecond=109 ) properties seen :30
[2025-06-02 13:39:26] [INFO ] Invariant cache hit.
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/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 136/212 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:27] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:27] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:27] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:28] [INFO ] Deduced a trap composed of 16 places in 332 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:28] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:28] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:29] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:29] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:29] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 9/16 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/16 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 512/724 variables, 212/228 constraints. Problems are: Problem set: 6 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:31] [INFO ] Deduced a trap composed of 126 places in 341 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:31] [INFO ] Deduced a trap composed of 127 places in 344 ms of which 48 ms to minimize.
SMT process timed out in 5137ms, After SMT, problems are : Problem set: 6 solved, 44 unsolved
Fused 44 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 63 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 512/512 transitions.
Graph (trivial) has 102 edges and 212 vertex of which 3 / 212 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 210 transition count 487
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 188 transition count 484
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 185 transition count 484
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 51 place count 185 transition count 474
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 71 place count 175 transition count 474
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 79 place count 167 transition count 459
Iterating global reduction 3 with 8 rules applied. Total rules applied 87 place count 167 transition count 459
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 119 place count 151 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 151 transition count 442
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 150 transition count 440
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 150 transition count 440
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 4 with 2 rules applied. Total rules applied 124 place count 149 transition count 439
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 132 place count 145 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 156 place count 145 transition count 428
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 160 place count 141 transition count 424
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 141 transition count 424
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 139 transition count 428
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 181 place count 139 transition count 415
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 194 place count 126 transition count 415
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 199 place count 126 transition count 418
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 204 place count 121 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 206 place count 121 transition count 416
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 208 place count 121 transition count 416
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 212 place count 121 transition count 412
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 213 place count 121 transition count 412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 120 transition count 411
Applied a total of 214 rules in 392 ms. Remains 120 /212 variables (removed 92) and now considering 411/512 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 120/212 places, 411/512 transitions.
RANDOM walk for 40000 steps (3625 resets) in 1067 ms. (37 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (67 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (74 resets) in 27 ms. (143 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (56 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (69 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (69 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (68 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (74 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (72 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (68 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (70 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (70 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (68 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (69 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (68 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (74 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (69 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (67 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (69 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (68 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (60 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (69 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (70 resets) in 53 ms. (74 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (70 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (70 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (71 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (59 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (75 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (69 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (71 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (69 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (71 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (52 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (77 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (71 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (71 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (66 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (69 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (69 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (69 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (71 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (67 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (72 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (69 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (68 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
Interrupted probabilistic random walk after 432349 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :10 out of 44
Probabilistic random walk after 432349 steps, saw 81657 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :10
[2025-06-02 13:39:36] [INFO ] Flow matrix only has 391 transitions (discarded 20 similar events)
// Phase 1: matrix 391 rows 120 cols
[2025-06-02 13:39:36] [INFO ] Computed 7 invariants in 9 ms
[2025-06-02 13:39:36] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 67/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:36] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:36] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:36] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:37] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 391/511 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 8/139 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/511 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 139 constraints, problems are : Problem set: 0 solved, 34 unsolved in 3217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 67/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:39] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:39] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 5 (OVERLAPS) 391/511 variables, 120/133 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 8/141 constraints. Problems are: Problem set: 7 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 27/168 constraints. Problems are: Problem set: 7 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:46] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:54] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:39:59] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 3/171 constraints. Problems are: Problem set: 7 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 171 constraints, problems are : Problem set: 7 solved, 27 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 27/34 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48275ms problems are : Problem set: 7 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 411/411 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 120 transition count 407
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 116 transition count 407
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 114 transition count 404
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 114 transition count 404
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 12 place count 114 transition count 403
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 113 transition count 403
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 16 place count 112 transition count 402
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 112 transition count 396
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 33 place count 106 transition count 391
Applied a total of 33 rules in 54 ms. Remains 106 /120 variables (removed 14) and now considering 391/411 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 106/120 places, 391/411 transitions.
RANDOM walk for 40000 steps (5696 resets) in 410 ms. (97 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (113 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (124 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (114 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (121 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (115 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (113 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (114 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (113 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (117 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (101 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (114 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (121 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (113 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (115 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (116 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (92 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (125 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (115 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (119 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (121 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (110 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (114 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (113 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (115 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (120 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (115 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (118 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 472291 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :13 out of 27
Probabilistic random walk after 472291 steps, saw 85848 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :13
[2025-06-02 13:40:27] [INFO ] Flow matrix only has 373 transitions (discarded 18 similar events)
// Phase 1: matrix 373 rows 106 cols
[2025-06-02 13:40:27] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 13:40:27] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 79/106 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:27] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 373/479 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 24/138 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 138 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 79/106 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 373/479 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 24/138 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:32] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:32] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:35] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:40:48] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 156 constraints, problems are : Problem set: 0 solved, 14 unsolved in 64024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65076ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 33431 ms.
Support contains 27 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 391/391 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 390
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 105 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 104 transition count 389
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4 place count 104 transition count 385
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 12 place count 100 transition count 385
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 15 place count 97 transition count 379
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 97 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 96 transition count 384
Free-agglomeration rule applied 15 times with reduction of 4 identical transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 35 place count 96 transition count 365
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 75 place count 81 transition count 340
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 80 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 80 transition count 336
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 80 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 79 transition count 335
Applied a total of 83 rules in 66 ms. Remains 79 /106 variables (removed 27) and now considering 335/391 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 79/106 places, 335/391 transitions.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
[2025-06-02 13:42:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 13:42:06] [INFO ] Flatten gal took : 48 ms
FORMULA MedleyA-PT-17-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 13:42:06] [INFO ] Flatten gal took : 44 ms
[2025-06-02 13:42:06] [INFO ] Input system was already deterministic with 512 transitions.
Support contains 90 out of 212 places (down from 92) after GAL structural reductions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 194 transition count 483
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 194 transition count 483
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 53 place count 194 transition count 466
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 191 transition count 460
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 191 transition count 460
Applied a total of 59 rules in 10 ms. Remains 191 /212 variables (removed 21) and now considering 460/512 (removed 52) transitions.
// Phase 1: matrix 460 rows 191 cols
[2025-06-02 13:42:06] [INFO ] Computed 7 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:42:06] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-02 13:42:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:42:06] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2025-06-02 13:42:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:16] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:17] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:17] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:17] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:18] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:18] [INFO ] Deduced a trap composed of 112 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:18] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:18] [INFO ] Deduced a trap composed of 112 places in 231 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:20] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:20] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:20] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:21] [INFO ] Deduced a trap composed of 21 places in 288 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:21] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:21] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:21] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:22] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:22] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:22] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:23] [INFO ] Deduced a trap composed of 25 places in 298 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:23] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:24] [INFO ] Deduced a trap composed of 112 places in 217 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:24] [INFO ] Deduced a trap composed of 95 places in 215 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:25] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:26] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:26] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:26] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:27] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:28] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:28] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:28] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:29] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:29] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:34] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:35] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:35] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:36] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:36] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/651 variables, and 44 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:41] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:41] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:41] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:42] [INFO ] Deduced a trap composed of 115 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:42] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:42] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:44] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:45] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:45] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:46] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:48] [INFO ] Deduced a trap composed of 116 places in 186 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:51] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:54] [INFO ] Deduced a trap composed of 112 places in 300 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:42:55] [INFO ] Deduced a trap composed of 112 places in 299 ms of which 39 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 9 (OVERLAPS) 460/651 variables, 191/249 constraints. Problems are: Problem set: 28 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/651 variables, and 680 constraints, problems are : Problem set: 28 solved, 431 unsolved in 30145 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 431/459 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60379ms problems are : Problem set: 28 solved, 431 unsolved
Search for dead transitions found 28 dead transitions in 60381ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/212 places, 432/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 191 /191 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60919 ms. Remains : 191/212 places, 432/512 transitions.
[2025-06-02 13:43:07] [INFO ] Flatten gal took : 49 ms
[2025-06-02 13:43:07] [INFO ] Flatten gal took : 43 ms
[2025-06-02 13:43:07] [INFO ] Input system was already deterministic with 432 transitions.
[2025-06-02 13:43:07] [INFO ] Flatten gal took : 41 ms
[2025-06-02 13:43:07] [INFO ] Flatten gal took : 42 ms
[2025-06-02 13:43:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11722907046153653122.gal : 28 ms
[2025-06-02 13:43:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3139156562270920675.ctl : 5 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/CTLFireability11722907046153653122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3139156562270920675.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.
Detected timeout of ITS tools.
[2025-06-02 13:43:37] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:43:37] [INFO ] Applying decomposition
[2025-06-02 13:43:37] [INFO ] Flatten gal took : 24 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/graph11406181618667318621.txt' '-o' '/tmp/graph11406181618667318621.bin' '-w' '/tmp/graph11406181618667318621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11406181618667318621.bin' '-l' '-1' '-v' '-w' '/tmp/graph11406181618667318621.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:43:38] [INFO ] Decomposing Gal with order
[2025-06-02 13:43:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:43:38] [INFO ] Removed a total of 1067 redundant transitions.
[2025-06-02 13:43:38] [INFO ] Flatten gal took : 185 ms
[2025-06-02 13:43:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 43 ms.
[2025-06-02 13:43:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6477809200680452136.gal : 17 ms
[2025-06-02 13:43:38] [INFO ] Time to serialize properties into /tmp/CTLFireability8800236030932853327.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/CTLFireability6477809200680452136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8800236030932853327.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,2.94137e+07,2.8611,86384,1833,53,177505,1127,859,387780,95,3235,0


Converting to forward existential form...Done !
original formula: EX((AG((i0.u60.p245==0)) + (!(A(((i8.u8.p34==1)&&(i5.i0.u44.p189==1)) U (i1.u13.p60==1))) * AX((i3.i0.u29.p127==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((i0.u60.p245==0)))))] != FALSE + [((EY(Init) * !(!((E(!((i1.u13.p60==1)) U (!(((i8.u8...282
Reverse transition relation is NOT exact ! Due to transitions t18, t66, t109, t166, t172, t182, t188, t190, t214, t222, t246, t254, t261, t262, t269, t270,...1021
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
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 a local 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 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
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,22.6716,666040,1,0,802991,1493,6574,5.18591e+06,487,4466,1235016
FORMULA MedleyA-PT-17-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 196 transition count 487
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 196 transition count 487
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 49 place count 196 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 194 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 194 transition count 466
Applied a total of 53 rules in 11 ms. Remains 194 /212 variables (removed 18) and now considering 466/512 (removed 46) transitions.
// Phase 1: matrix 466 rows 194 cols
[2025-06-02 13:44:01] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:44:01] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-02 13:44:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:44:02] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-06-02 13:44:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:12] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:12] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:12] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:13] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:13] [INFO ] Deduced a trap composed of 25 places in 306 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:13] [INFO ] Deduced a trap composed of 25 places in 306 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:14] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:14] [INFO ] Deduced a trap composed of 114 places in 217 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:14] [INFO ] Deduced a trap composed of 114 places in 225 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:14] [INFO ] Deduced a trap composed of 114 places in 245 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:15] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:16] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:16] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:17] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:17] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:17] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:18] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:18] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:18] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:18] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:19] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:20] [INFO ] Deduced a trap composed of 39 places in 309 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:20] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:21] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:22] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:22] [INFO ] Deduced a trap composed of 22 places in 287 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:23] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:23] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:23] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:24] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:24] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:25] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:30] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:44:32] [INFO ] Deduced a trap composed of 40 places in 301 ms of which 46 ms to minimize.
SMT process timed out in 30371ms, After SMT, problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 30373ms
Starting structural reductions in LTL mode, iteration 1 : 194/212 places, 466/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31159 ms. Remains : 194/212 places, 466/512 transitions.
[2025-06-02 13:44:32] [INFO ] Flatten gal took : 39 ms
[2025-06-02 13:44:32] [INFO ] Flatten gal took : 40 ms
[2025-06-02 13:44:32] [INFO ] Input system was already deterministic with 466 transitions.
[2025-06-02 13:44:32] [INFO ] Flatten gal took : 38 ms
[2025-06-02 13:44:32] [INFO ] Flatten gal took : 40 ms
[2025-06-02 13:44:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10302224605278430310.gal : 10 ms
[2025-06-02 13:44:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2702425062646890924.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/CTLFireability10302224605278430310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2702425062646890924.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.
Detected timeout of ITS tools.
[2025-06-02 13:45:02] [INFO ] Flatten gal took : 24 ms
[2025-06-02 13:45:02] [INFO ] Applying decomposition
[2025-06-02 13:45:02] [INFO ] Flatten gal took : 22 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/graph3268385984146885420.txt' '-o' '/tmp/graph3268385984146885420.bin' '-w' '/tmp/graph3268385984146885420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3268385984146885420.bin' '-l' '-1' '-v' '-w' '/tmp/graph3268385984146885420.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:45:03] [INFO ] Decomposing Gal with order
[2025-06-02 13:45:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:45:03] [INFO ] Removed a total of 752 redundant transitions.
[2025-06-02 13:45:03] [INFO ] Flatten gal took : 63 ms
[2025-06-02 13:45:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 30 ms.
[2025-06-02 13:45:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17269753866634851573.gal : 8 ms
[2025-06-02 13:45:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13307282508984364069.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/CTLFireability17269753866634851573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13307282508984364069.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Graph (trivial) has 223 edges and 212 vertex of which 9 / 212 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 205 transition count 477
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 177 transition count 477
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 57 place count 177 transition count 463
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 85 place count 163 transition count 463
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 101 place count 147 transition count 434
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 147 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 133 place count 147 transition count 418
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 133 place count 147 transition count 416
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 145 transition count 416
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 142 transition count 396
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 142 transition count 396
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 179 place count 124 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 124 transition count 377
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 122 transition count 363
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 122 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 192 place count 122 transition count 355
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 200 place count 118 transition count 351
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 117 transition count 350
Applied a total of 201 rules in 93 ms. Remains 117 /212 variables (removed 95) and now considering 350/512 (removed 162) transitions.
[2025-06-02 13:45:33] [INFO ] Flow matrix only has 348 transitions (discarded 2 similar events)
// Phase 1: matrix 348 rows 117 cols
[2025-06-02 13:45:33] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:45:33] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-02 13:45:33] [INFO ] Flow matrix only has 348 transitions (discarded 2 similar events)
[2025-06-02 13:45:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:45:33] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 13:45:33] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:45:34] [INFO ] Redundant transitions in 43 ms returned []
Running 341 sub problems to find dead transitions.
[2025-06-02 13:45:34] [INFO ] Flow matrix only has 348 transitions (discarded 2 similar events)
[2025-06-02 13:45:34] [INFO ] Invariant cache hit.
[2025-06-02 13:45:34] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:36] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:36] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:36] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:36] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:36] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:37] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:38] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:38] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:38] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:45:38] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (OVERLAPS) 347/464 variables, 117/138 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 64/202 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (OVERLAPS) 1/465 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/465 variables, and 203 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 3 (OVERLAPS) 347/464 variables, 117/138 constraints. Problems are: Problem set: 36 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 64/202 constraints. Problems are: Problem set: 36 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 305/507 constraints. Problems are: Problem set: 36 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/465 variables, and 507 constraints, problems are : Problem set: 36 solved, 305 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 305/341 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60346ms problems are : Problem set: 36 solved, 305 unsolved
Search for dead transitions found 36 dead transitions in 60348ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 117/212 places, 314/512 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:46:34] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61151 ms. Remains : 117/212 places, 314/512 transitions.
[2025-06-02 13:46:34] [INFO ] Flatten gal took : 15 ms
[2025-06-02 13:46:34] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:46:34] [INFO ] Input system was already deterministic with 314 transitions.
[2025-06-02 13:46:34] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:46:34] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:46:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8668639373178217329.gal : 4 ms
[2025-06-02 13:46:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14565393293043677705.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/CTLFireability8668639373178217329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14565393293043677705.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.
Detected timeout of ITS tools.
[2025-06-02 13:47:04] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:47:04] [INFO ] Applying decomposition
[2025-06-02 13:47:04] [INFO ] Flatten gal took : 14 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/graph13676973393362137898.txt' '-o' '/tmp/graph13676973393362137898.bin' '-w' '/tmp/graph13676973393362137898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13676973393362137898.bin' '-l' '-1' '-v' '-w' '/tmp/graph13676973393362137898.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:47:04] [INFO ] Decomposing Gal with order
[2025-06-02 13:47:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:47:04] [INFO ] Removed a total of 373 redundant transitions.
[2025-06-02 13:47:04] [INFO ] Flatten gal took : 28 ms
[2025-06-02 13:47:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 8 ms.
[2025-06-02 13:47:04] [INFO ] Time to serialize gal into /tmp/CTLFireability4760220666511188129.gal : 4 ms
[2025-06-02 13:47:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14556156894685126106.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/CTLFireability4760220666511188129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14556156894685126106.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.52216e+06,5.44726,137708,743,5300,49535,212122,566,217815,270,1.46517e+06,0


Converting to forward existential form...Done !
original formula: AF(((AG((i6.u19.p177==1)) * (i5.u1.p12==1)) * (i3.u16.p152==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((i6.u19.p177==1)))) * (i5.u1.p12==1)) * (i3.u16.p152==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t32, t35, t37, t60, t76, t87, t99, t101, t110, t112, t114, t116, t118, t119, t120, t122,...651
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,12.6273,251828,1,0,93398,479651,3729,389569,2278,2.66122e+06,259488
FORMULA MedleyA-PT-17-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 195 transition count 483
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 195 transition count 483
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 51 place count 195 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 194 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 194 transition count 464
Applied a total of 53 rules in 6 ms. Remains 194 /212 variables (removed 18) and now considering 464/512 (removed 48) transitions.
// Phase 1: matrix 464 rows 194 cols
[2025-06-02 13:47:17] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:47:17] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 13:47:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:47:18] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-06-02 13:47:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:28] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:28] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:28] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:29] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:29] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:29] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:30] [INFO ] Deduced a trap composed of 97 places in 322 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:30] [INFO ] Deduced a trap composed of 114 places in 289 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:30] [INFO ] Deduced a trap composed of 116 places in 292 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:31] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:31] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:31] [INFO ] Deduced a trap composed of 116 places in 238 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:32] [INFO ] Deduced a trap composed of 23 places in 324 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:33] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:33] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:33] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:34] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:34] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:34] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:35] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:35] [INFO ] Deduced a trap composed of 116 places in 204 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:35] [INFO ] Deduced a trap composed of 97 places in 216 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:37] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:37] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:38] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:38] [INFO ] Deduced a trap composed of 25 places in 318 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:38] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:39] [INFO ] Deduced a trap composed of 39 places in 310 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:39] [INFO ] Deduced a trap composed of 39 places in 296 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:39] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:40] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:40] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:40] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:42] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:42] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:42] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/658 variables, and 43 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/194 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:53] [INFO ] Deduced a trap composed of 114 places in 316 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:54] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:54] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:55] [INFO ] Deduced a trap composed of 38 places in 236 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:47:59] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:00] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:00] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:00] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:05] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:05] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:48:10] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/658 variables, and 54 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/194 constraints, PredecessorRefiner: 0/463 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60319ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Starting structural reductions in LTL mode, iteration 1 : 194/212 places, 464/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60977 ms. Remains : 194/212 places, 464/512 transitions.
[2025-06-02 13:48:18] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:48:18] [INFO ] Flatten gal took : 34 ms
[2025-06-02 13:48:18] [INFO ] Input system was already deterministic with 464 transitions.
[2025-06-02 13:48:18] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:48:18] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:48:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17630147211414845571.gal : 7 ms
[2025-06-02 13:48:18] [INFO ] Time to serialize properties into /tmp/CTLFireability783216813741735106.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/CTLFireability17630147211414845571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability783216813741735106.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.
Detected timeout of ITS tools.
[2025-06-02 13:48:48] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:48:48] [INFO ] Applying decomposition
[2025-06-02 13:48:48] [INFO ] Flatten gal took : 18 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/graph9944395079014392654.txt' '-o' '/tmp/graph9944395079014392654.bin' '-w' '/tmp/graph9944395079014392654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9944395079014392654.bin' '-l' '-1' '-v' '-w' '/tmp/graph9944395079014392654.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:48:48] [INFO ] Decomposing Gal with order
[2025-06-02 13:48:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:48:48] [INFO ] Removed a total of 1064 redundant transitions.
[2025-06-02 13:48:48] [INFO ] Flatten gal took : 45 ms
[2025-06-02 13:48:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 19 ms.
[2025-06-02 13:48:48] [INFO ] Time to serialize gal into /tmp/CTLFireability3546123126853027572.gal : 5 ms
[2025-06-02 13:48:48] [INFO ] Time to serialize properties into /tmp/CTLFireability13161232648536157351.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/CTLFireability3546123126853027572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13161232648536157351.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.98546e+07,22.9831,410720,6069,470,259776,21731,1158,3.93626e+06,173,190390,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 194 transition count 482
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 194 transition count 482
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 53 place count 194 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 192 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 192 transition count 461
Applied a total of 57 rules in 7 ms. Remains 192 /212 variables (removed 20) and now considering 461/512 (removed 51) transitions.
// Phase 1: matrix 461 rows 192 cols
[2025-06-02 13:49:18] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:49:19] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-02 13:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:49:19] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-02 13:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:29] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:29] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:29] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:29] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 112 places in 335 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 112 places in 300 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:30] [INFO ] Deduced a trap composed of 113 places in 226 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 37 places in 293 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 38 places in 286 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:31] [INFO ] Deduced a trap composed of 39 places in 289 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:32] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:33] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:34] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:35] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:35] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:36] [INFO ] Deduced a trap composed of 113 places in 221 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:36] [INFO ] Deduced a trap composed of 113 places in 228 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:36] [INFO ] Deduced a trap composed of 95 places in 223 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:38] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:38] [INFO ] Deduced a trap composed of 117 places in 310 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:38] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:39] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:39] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:39] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:40] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:40] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:41] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:42] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:47] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:48] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:49] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:49] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:49] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 15 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/653 variables, and 45 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:54] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:55] [INFO ] Deduced a trap composed of 112 places in 292 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:55] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:49:59] [INFO ] Deduced a trap composed of 112 places in 294 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:00] [INFO ] Deduced a trap composed of 39 places in 297 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:04] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:05] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:05] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:06] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:06] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:50:11] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(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 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(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 0)
(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 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(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 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)timeout

(s181 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/653 variables, and 56 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 0/460 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Starting structural reductions in LTL mode, iteration 1 : 192/212 places, 461/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60717 ms. Remains : 192/212 places, 461/512 transitions.
[2025-06-02 13:50:19] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:50:19] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:50:19] [INFO ] Input system was already deterministic with 461 transitions.
[2025-06-02 13:50:19] [INFO ] Flatten gal took : 31 ms
[2025-06-02 13:50:19] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:50:19] [INFO ] Time to serialize gal into /tmp/CTLFireability7798004807599961930.gal : 6 ms
[2025-06-02 13:50:19] [INFO ] Time to serialize properties into /tmp/CTLFireability7313385729285845142.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/CTLFireability7798004807599961930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7313385729285845142.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.
Detected timeout of ITS tools.
[2025-06-02 13:50:50] [INFO ] Flatten gal took : 28 ms
[2025-06-02 13:50:50] [INFO ] Applying decomposition
[2025-06-02 13:50:50] [INFO ] Flatten gal took : 27 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/graph3554303172902507038.txt' '-o' '/tmp/graph3554303172902507038.bin' '-w' '/tmp/graph3554303172902507038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3554303172902507038.bin' '-l' '-1' '-v' '-w' '/tmp/graph3554303172902507038.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:50:50] [INFO ] Decomposing Gal with order
[2025-06-02 13:50:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:50:50] [INFO ] Removed a total of 1087 redundant transitions.
[2025-06-02 13:50:50] [INFO ] Flatten gal took : 60 ms
[2025-06-02 13:50:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 22 ms.
[2025-06-02 13:50:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7049594403928935569.gal : 8 ms
[2025-06-02 13:50:50] [INFO ] Time to serialize properties into /tmp/CTLFireability13184397994539831147.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/CTLFireability7049594403928935569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13184397994539831147.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.85258e+07,18.6561,331356,4492,294,194145,4596,1118,3.33712e+06,151,17471,0


Converting to forward existential form...Done !
original formula: EF((!(A(AF((((i7.u7.p46==1)&&(i0.u12.p71==1))&&((i4.u54.p232==1)&&(i7.u56.p242==1)))) U EG((i7.u13.p57==1)))) * ((i5.u50.p218==0) + ((EX(...291
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(!((E(!(EG((i7.u13.p57==1))) U (!(!(EG(!((((i7.u7.p46==1)&&(i0.u12.p71==1))&&((i4.u54.p23...634
Reverse transition relation is NOT exact ! Due to transitions t20, t37, t104, t112, t140, t171, t173, t175, t187, t189, t191, t213, t215, t221, t223, t245,...940
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
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
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
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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 : 212/212 places, 512/512 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 194 transition count 482
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 194 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 194 transition count 481
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 191 transition count 475
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 191 transition count 475
Applied a total of 43 rules in 6 ms. Remains 191 /212 variables (removed 21) and now considering 475/512 (removed 37) transitions.
// Phase 1: matrix 475 rows 191 cols
[2025-06-02 13:51:20] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:51:20] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-02 13:51:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:51:20] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2025-06-02 13:51:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:30] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:31] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:31] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:31] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:32] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:32] [INFO ] Deduced a trap composed of 96 places in 231 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:32] [INFO ] Deduced a trap composed of 112 places in 231 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:32] [INFO ] Deduced a trap composed of 40 places in 314 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:33] [INFO ] Deduced a trap composed of 93 places in 314 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:33] [INFO ] Deduced a trap composed of 112 places in 284 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:33] [INFO ] Deduced a trap composed of 112 places in 312 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:34] [INFO ] Deduced a trap composed of 113 places in 306 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:35] [INFO ] Deduced a trap composed of 24 places in 325 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:35] [INFO ] Deduced a trap composed of 24 places in 320 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:36] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:36] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:36] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:37] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:37] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:37] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:38] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:39] [INFO ] Deduced a trap composed of 24 places in 315 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:40] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:40] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:40] [INFO ] Deduced a trap composed of 38 places in 297 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:41] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:41] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:41] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:42] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:42] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:42] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:43] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:43] [INFO ] Deduced a trap composed of 113 places in 289 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:44] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:45] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:45] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:45] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:50] [INFO ] Deduced a trap composed of 40 places in 296 ms of which 35 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 191/666 variables, and 45 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/191 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:56] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:57] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:51:57] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:02] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:02] [INFO ] Deduced a trap composed of 114 places in 309 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:02] [INFO ] Deduced a trap composed of 34 places in 314 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:03] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:03] [INFO ] Deduced a trap composed of 25 places in 298 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:52:08] [INFO ] Deduced a trap composed of 113 places in 268 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 7 (OVERLAPS) 475/666 variables, 191/245 constraints. Problems are: Problem set: 50 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 669 constraints, problems are : Problem set: 50 solved, 424 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 424/474 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60336ms problems are : Problem set: 50 solved, 424 unsolved
Search for dead transitions found 50 dead transitions in 60338ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/212 places, 425/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 191 /191 variables (removed 0) and now considering 425/425 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60854 ms. Remains : 191/212 places, 425/512 transitions.
[2025-06-02 13:52:21] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:52:21] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:52:21] [INFO ] Input system was already deterministic with 425 transitions.
[2025-06-02 13:52:21] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:52:21] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:52:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13893650748844107422.gal : 3 ms
[2025-06-02 13:52:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5820504361869426154.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/CTLFireability13893650748844107422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5820504361869426154.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.
Detected timeout of ITS tools.
[2025-06-02 13:52:51] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:52:51] [INFO ] Applying decomposition
[2025-06-02 13:52:51] [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/graph16278213771984691233.txt' '-o' '/tmp/graph16278213771984691233.bin' '-w' '/tmp/graph16278213771984691233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16278213771984691233.bin' '-l' '-1' '-v' '-w' '/tmp/graph16278213771984691233.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:52:51] [INFO ] Decomposing Gal with order
[2025-06-02 13:52:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:52:51] [INFO ] Removed a total of 962 redundant transitions.
[2025-06-02 13:52:51] [INFO ] Flatten gal took : 43 ms
[2025-06-02 13:52:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 5 ms.
[2025-06-02 13:52:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3841431928505206414.gal : 16 ms
[2025-06-02 13:52:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2025907538712076218.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/CTLFireability3841431928505206414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2025907538712076218.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,3.00257e+07,6.84382,163808,2699,41,273010,1042,831,1.08354e+06,84,2923,0


Converting to forward existential form...Done !
original formula: AX((EG((i6.i0.u28.p129==0)) + ((AF((((i3.i0.u60.p175==1)&&(i2.u16.p69==1)) + A((((i3.i0.u10.p52==1)&&(i11.u22.p97==1))&&((i6.i0.u28.p167=...314
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(EG((i6.i0.u28.p129==0)))),!((((i3.i0.u60.p175==1)&&(i2.u16.p69==1)) + !((E(!((i3.i1.u24.p1...553
Reverse transition relation is NOT exact ! Due to transitions t20, t41, t75, t77, t98, t139, t158, t165, t171, t173, t181, t187, t189, t214, t222, t262, t2...1014
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 194 transition count 481
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 194 transition count 481
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 53 place count 194 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 192 transition count 460
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 192 transition count 460
Applied a total of 57 rules in 7 ms. Remains 192 /212 variables (removed 20) and now considering 460/512 (removed 52) transitions.
// Phase 1: matrix 460 rows 192 cols
[2025-06-02 13:53:21] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:21] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 13:53:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:53:21] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2025-06-02 13:53:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:31] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:32] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:32] [INFO ] Deduced a trap composed of 16 places in 275 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:32] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:32] [INFO ] Deduced a trap composed of 16 places in 275 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:33] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:33] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:33] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:34] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:34] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:34] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:34] [INFO ] Deduced a trap composed of 96 places in 211 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:35] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:35] [INFO ] Deduced a trap composed of 91 places in 223 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:36] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:37] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:37] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:37] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:37] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:38] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:38] [INFO ] Deduced a trap composed of 113 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:39] [INFO ] Deduced a trap composed of 113 places in 210 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:39] [INFO ] Deduced a trap composed of 96 places in 221 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:39] [INFO ] Deduced a trap composed of 26 places in 302 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:40] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:40] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:41] [INFO ] Deduced a trap composed of 113 places in 299 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:41] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 37 places in 292 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:42] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:43] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:43] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:43] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:44] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:45] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:50] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:50] [INFO ] Deduced a trap composed of 41 places in 269 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:51] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:51] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:52] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/652 variables, and 52 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:57] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:59] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:59] [INFO ] Deduced a trap composed of 41 places in 270 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:53:59] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:03] [INFO ] Deduced a trap composed of 113 places in 299 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:03] [INFO ] Deduced a trap composed of 40 places in 284 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:03] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:07] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:08] [INFO ] Deduced a trap composed of 114 places in 300 ms of which 42 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:54:13] [INFO ] Deduced a trap composed of 39 places in 316 ms of which 44 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(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 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/652 variables, and 62 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 0/459 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 192/212 places, 460/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60621 ms. Remains : 192/212 places, 460/512 transitions.
[2025-06-02 13:54:22] [INFO ] Flatten gal took : 25 ms
[2025-06-02 13:54:22] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:54:22] [INFO ] Input system was already deterministic with 460 transitions.
[2025-06-02 13:54:22] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:54:22] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:54:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2561027242463473893.gal : 5 ms
[2025-06-02 13:54:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9012690796172421300.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/CTLFireability2561027242463473893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9012690796172421300.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.
Detected timeout of ITS tools.
[2025-06-02 13:54:52] [INFO ] Flatten gal took : 15 ms
[2025-06-02 13:54:52] [INFO ] Applying decomposition
[2025-06-02 13:54:52] [INFO ] Flatten gal took : 15 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/graph16888248080082681746.txt' '-o' '/tmp/graph16888248080082681746.bin' '-w' '/tmp/graph16888248080082681746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16888248080082681746.bin' '-l' '-1' '-v' '-w' '/tmp/graph16888248080082681746.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:54:52] [INFO ] Decomposing Gal with order
[2025-06-02 13:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:54:52] [INFO ] Removed a total of 1035 redundant transitions.
[2025-06-02 13:54:52] [INFO ] Flatten gal took : 36 ms
[2025-06-02 13:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 7 ms.
[2025-06-02 13:54:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9406680212502034810.gal : 5 ms
[2025-06-02 13:54:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15816225913299775126.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/CTLFireability9406680212502034810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15816225913299775126.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.85667e+07,19.5367,447480,5482,542,213264,9239,1020,4.90574e+06,169,47519,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Graph (trivial) has 215 edges and 212 vertex of which 9 / 212 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 205 transition count 480
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 180 transition count 478
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 178 transition count 478
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 55 place count 178 transition count 466
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 79 place count 166 transition count 466
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 95 place count 150 transition count 438
Iterating global reduction 3 with 16 rules applied. Total rules applied 111 place count 150 transition count 438
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 127 place count 150 transition count 422
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 127 place count 150 transition count 419
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 133 place count 147 transition count 419
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 146 transition count 417
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 146 transition count 417
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 169 place count 129 transition count 400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 170 place count 129 transition count 399
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 172 place count 127 transition count 381
Iterating global reduction 5 with 2 rules applied. Total rules applied 174 place count 127 transition count 381
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 182 place count 127 transition count 373
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 190 place count 123 transition count 369
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 123 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 122 transition count 368
Applied a total of 192 rules in 102 ms. Remains 122 /212 variables (removed 90) and now considering 368/512 (removed 144) transitions.
[2025-06-02 13:55:22] [INFO ] Flow matrix only has 366 transitions (discarded 2 similar events)
// Phase 1: matrix 366 rows 122 cols
[2025-06-02 13:55:22] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:55:22] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-02 13:55:22] [INFO ] Flow matrix only has 366 transitions (discarded 2 similar events)
[2025-06-02 13:55:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:55:23] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 13:55:23] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:55:23] [INFO ] Redundant transitions in 6 ms returned []
Running 359 sub problems to find dead transitions.
[2025-06-02 13:55:23] [INFO ] Flow matrix only has 366 transitions (discarded 2 similar events)
[2025-06-02 13:55:23] [INFO ] Invariant cache hit.
[2025-06-02 13:55:23] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:25] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:26] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:26] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:26] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:26] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:27] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:27] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:27] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:27] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:27] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:28] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:28] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:28] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:29] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:55:30] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (OVERLAPS) 365/487 variables, 122/144 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 64/208 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (OVERLAPS) 1/488 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 209 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 3 (OVERLAPS) 365/487 variables, 122/144 constraints. Problems are: Problem set: 42 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 64/208 constraints. Problems are: Problem set: 42 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 317/525 constraints. Problems are: Problem set: 42 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/488 variables, and 525 constraints, problems are : Problem set: 42 solved, 317 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 317/359 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60215ms problems are : Problem set: 42 solved, 317 unsolved
Search for dead transitions found 42 dead transitions in 60217ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 122/212 places, 326/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:56:23] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60936 ms. Remains : 122/212 places, 326/512 transitions.
[2025-06-02 13:56:23] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:56:23] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:56:23] [INFO ] Input system was already deterministic with 326 transitions.
[2025-06-02 13:56:23] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:56:23] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:56:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14702261306574033072.gal : 2 ms
[2025-06-02 13:56:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5326925244683705533.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/CTLFireability14702261306574033072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5326925244683705533.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.09682e+06,4.63768,105844,2,25534,5,283093,6,0,814,306322,0


Converting to forward existential form...Done !
original formula: EG((EF((((((p18==0)||(p119==0))&&(p72==0))&&((p165==0)&&(p18==1)))&&(p115==1))) + ((p12==1)&&(p214==1))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((((p18==0)||(p119==0))&&(p72==0))&&((p165==0)&&(p18==1)))&&(p115==1))) + ((p12==1)&&(p214...172
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t8, t10, t12, t17, t18, t20, t23, t29, t32, t37, t39, t41, t43, t44, t45, t50, t51, t...633
Detected timeout of ITS tools.
[2025-06-02 13:56:53] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:56:53] [INFO ] Applying decomposition
[2025-06-02 13:56:53] [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/graph3338489534695084642.txt' '-o' '/tmp/graph3338489534695084642.bin' '-w' '/tmp/graph3338489534695084642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3338489534695084642.bin' '-l' '-1' '-v' '-w' '/tmp/graph3338489534695084642.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:56:53] [INFO ] Decomposing Gal with order
[2025-06-02 13:56:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:56:53] [INFO ] Removed a total of 439 redundant transitions.
[2025-06-02 13:56:53] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:56:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 4 ms.
[2025-06-02 13:56:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17466436262012988203.gal : 3 ms
[2025-06-02 13:56:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10972562999880277723.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/CTLFireability17466436262012988203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10972562999880277723.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.09682e+06,4.17456,96128,714,3922,27728,105732,605,252903,263,924621,0


Converting to forward existential form...Done !
original formula: EG((EF((((((i6.u0.p18==0)||(i5.u13.p119==0))&&(i1.u8.p72==0))&&((i2.i1.u20.p165==0)&&(i6.u0.p18==1)))&&(i5.u12.p115==1))) + ((u1.p12==1)&...175
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((((i6.u0.p18==0)||(i5.u13.p119==0))&&(i1.u8.p72==0))&&((i2.i1.u20.p165==0)&&(i6.u0.p18==1...224
Reverse transition relation is NOT exact ! Due to transitions t32, t54, t65, t72, t98, t100, t109, t111, t113, t115, t117, t118, t119, t121, t122, t123, t1...728
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Graph (trivial) has 163 edges and 212 vertex of which 6 / 212 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 207 transition count 480
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 180 transition count 480
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 55 place count 180 transition count 465
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 85 place count 165 transition count 465
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 101 place count 149 transition count 437
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 149 transition count 437
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 133 place count 149 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 133 place count 149 transition count 419
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 147 transition count 419
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 145 transition count 401
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 145 transition count 401
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 175 place count 128 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 128 transition count 383
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 178 place count 126 transition count 369
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 126 transition count 369
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 188 place count 126 transition count 361
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 196 place count 122 transition count 357
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 122 transition count 357
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 121 transition count 356
Applied a total of 199 rules in 51 ms. Remains 121 /212 variables (removed 91) and now considering 356/512 (removed 156) transitions.
[2025-06-02 13:57:23] [INFO ] Flow matrix only has 355 transitions (discarded 1 similar events)
// Phase 1: matrix 355 rows 121 cols
[2025-06-02 13:57:23] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:57:23] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-02 13:57:23] [INFO ] Flow matrix only has 355 transitions (discarded 1 similar events)
[2025-06-02 13:57:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:57:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 13:57:24] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:57:24] [INFO ] Redundant transitions in 2 ms returned []
Running 346 sub problems to find dead transitions.
[2025-06-02 13:57:24] [INFO ] Flow matrix only has 355 transitions (discarded 1 similar events)
[2025-06-02 13:57:24] [INFO ] Invariant cache hit.
[2025-06-02 13:57:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:26] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:27] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (OVERLAPS) 1/121 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:34] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:35] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (OVERLAPS) 354/475 variables, 121/138 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:44] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:45] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:57:45] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/476 variables, and 141 constraints, problems are : Problem set: 0 solved, 346 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (OVERLAPS) 1/121 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (OVERLAPS) 354/475 variables, 121/141 constraints. Problems are: Problem set: 36 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 310/451 constraints. Problems are: Problem set: 36 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:58:17] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 1/452 constraints. Problems are: Problem set: 36 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/476 variables, and 452 constraints, problems are : Problem set: 36 solved, 310 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 310/346 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60201ms problems are : Problem set: 36 solved, 310 unsolved
Search for dead transitions found 36 dead transitions in 60203ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 121/212 places, 320/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:58:24] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60642 ms. Remains : 121/212 places, 320/512 transitions.
[2025-06-02 13:58:24] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:58:24] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:58:24] [INFO ] Input system was already deterministic with 320 transitions.
[2025-06-02 13:58:24] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:58:24] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:58:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8700552496220572357.gal : 2 ms
[2025-06-02 13:58:24] [INFO ] Time to serialize properties into /tmp/CTLFireability2251451721848697316.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/CTLFireability8700552496220572357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2251451721848697316.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.56574e+06,28.2818,595044,2,49544,5,1.35127e+06,6,0,805,1.5146e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 13:58:54] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:58:54] [INFO ] Applying decomposition
[2025-06-02 13:58:54] [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/graph10754407420666511611.txt' '-o' '/tmp/graph10754407420666511611.bin' '-w' '/tmp/graph10754407420666511611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10754407420666511611.bin' '-l' '-1' '-v' '-w' '/tmp/graph10754407420666511611.weights' '-q' '0' '-e' '0.001'
[2025-06-02 13:58:54] [INFO ] Decomposing Gal with order
[2025-06-02 13:58:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:58:54] [INFO ] Removed a total of 748 redundant transitions.
[2025-06-02 13:58:54] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:58:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 5 ms.
[2025-06-02 13:58:54] [INFO ] Time to serialize gal into /tmp/CTLFireability17095898686879831782.gal : 3 ms
[2025-06-02 13:58:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8332148072284091121.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/CTLFireability17095898686879831782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8332148072284091121.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.56574e+06,0.344127,15260,634,31,20766,383,628,37313,72,1004,0


Converting to forward existential form...Done !
original formula: EG((((EF(((EF((((i0.u2.p27==1)&&(i2.u10.p71==1))&&((i7.u33.p232==1)&&(i0.u39.p242==1)))) * (i3.u12.p96==1)) * (i5.i0.u20.p166==1))) + !(A...448
=> equivalent forward existential formula: [FwdG(Init,(((E(TRUE U ((E(TRUE U (((i0.u2.p27==1)&&(i2.u10.p71==1))&&((i7.u33.p232==1)&&(i0.u39.p242==1)))) * (...668
Reverse transition relation is NOT exact ! Due to transitions t30, t63, t70, t82, t96, t98, t107, t109, t117, t118, t119, t121, t122, t123, t124, t157, t15...662
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 a local 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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
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 a local 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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,20.247,529616,1,0,885841,724,4896,2.14099e+06,362,2267,2260778
FORMULA MedleyA-PT-17-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 194 transition count 483
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 194 transition count 483
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 53 place count 194 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 192 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 192 transition count 462
Applied a total of 57 rules in 20 ms. Remains 192 /212 variables (removed 20) and now considering 462/512 (removed 50) transitions.
// Phase 1: matrix 462 rows 192 cols
[2025-06-02 13:59:15] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:59:15] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 13:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:59:15] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2025-06-02 13:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:25] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:25] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:25] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:26] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:26] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:26] [INFO ] Deduced a trap composed of 113 places in 305 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:26] [INFO ] Deduced a trap composed of 113 places in 220 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:27] [INFO ] Deduced a trap composed of 95 places in 206 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:27] [INFO ] Deduced a trap composed of 113 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:27] [INFO ] Deduced a trap composed of 37 places in 294 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:28] [INFO ] Deduced a trap composed of 113 places in 299 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:29] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:29] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:30] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:30] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:30] [INFO ] Deduced a trap composed of 40 places in 276 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:31] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:31] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:31] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:31] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:32] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:32] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:33] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:33] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:33] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:34] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:35] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:36] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:36] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:37] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:38] [INFO ] Deduced a trap composed of 43 places in 239 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:38] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:43] [INFO ] Deduced a trap composed of 23 places in 303 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:44] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:44] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:45] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:59:46] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 31 ms to minimize.
SMT process timed out in 30477ms, After SMT, problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 30478ms
Starting structural reductions in LTL mode, iteration 1 : 192/212 places, 462/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30983 ms. Remains : 192/212 places, 462/512 transitions.
[2025-06-02 13:59:46] [INFO ] Flatten gal took : 32 ms
[2025-06-02 13:59:46] [INFO ] Flatten gal took : 49 ms
[2025-06-02 13:59:46] [INFO ] Input system was already deterministic with 462 transitions.
[2025-06-02 13:59:46] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:59:46] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:59:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16270190195916235689.gal : 4 ms
[2025-06-02 13:59:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15182264228793674184.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/CTLFireability16270190195916235689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15182264228793674184.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.
Detected timeout of ITS tools.
[2025-06-02 14:00:16] [INFO ] Flatten gal took : 16 ms
[2025-06-02 14:00:16] [INFO ] Applying decomposition
[2025-06-02 14:00:16] [INFO ] Flatten gal took : 16 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/graph6079569304864800316.txt' '-o' '/tmp/graph6079569304864800316.bin' '-w' '/tmp/graph6079569304864800316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6079569304864800316.bin' '-l' '-1' '-v' '-w' '/tmp/graph6079569304864800316.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:00:16] [INFO ] Decomposing Gal with order
[2025-06-02 14:00:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:00:16] [INFO ] Removed a total of 1065 redundant transitions.
[2025-06-02 14:00:16] [INFO ] Flatten gal took : 31 ms
[2025-06-02 14:00:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 9 ms.
[2025-06-02 14:00:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3908671741639731678.gal : 4 ms
[2025-06-02 14:00:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3120353880811831528.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/CTLFireability3908671741639731678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3120353880811831528.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,2.9286e+07,15.8809,341712,3827,406,191976,21359,1163,3.50394e+06,173,132688,0


Converting to forward existential form...Done !
original formula: EF(((((i6.u2.p21==1)&&(i7.i2.u15.p79==1))&&((i2.i1.u21.p167==1)&&(i6.u56.p242==1))) * ((EX((i6.u55.p236==1)) + (i6.u5.p22==1)) + ((i4.i2....213
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * (((i6.u2.p21==1)&&(i7.i2.u15.p79==1))&&((i2.i1.u21.p167==1)&&(i6.u56.p242==1))))) * (i...495
(forward)formula 0,1,15.9618,341712,1,0,191976,21359,1695,3.50394e+06,252,132688,7357
FORMULA MedleyA-PT-17-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 192 transition count 479
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 192 transition count 479
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 57 place count 192 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 189 transition count 456
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 189 transition count 456
Applied a total of 63 rules in 10 ms. Remains 189 /212 variables (removed 23) and now considering 456/512 (removed 56) transitions.
// Phase 1: matrix 456 rows 189 cols
[2025-06-02 14:00:32] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:00:32] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-02 14:00:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:00:33] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2025-06-02 14:00:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:42] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:43] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:43] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:43] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:43] [INFO ] Deduced a trap composed of 95 places in 238 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:44] [INFO ] Deduced a trap composed of 111 places in 194 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:44] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:45] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:46] [INFO ] Deduced a trap composed of 24 places in 310 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:46] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:46] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:47] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:47] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:47] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:47] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:48] [INFO ] Deduced a trap composed of 37 places in 297 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:48] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:48] [INFO ] Deduced a trap composed of 111 places in 199 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:49] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:49] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:50] [INFO ] Deduced a trap composed of 111 places in 305 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:51] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:52] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:52] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:52] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:53] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:53] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:54] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:54] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:55] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:00:55] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:02] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:02] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:02] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:03] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:03] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 23 ms to minimize.
SMT process timed out in 30329ms, After SMT, problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 30331ms
Starting structural reductions in LTL mode, iteration 1 : 189/212 places, 456/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30990 ms. Remains : 189/212 places, 456/512 transitions.
[2025-06-02 14:01:03] [INFO ] Flatten gal took : 24 ms
[2025-06-02 14:01:03] [INFO ] Flatten gal took : 26 ms
[2025-06-02 14:01:03] [INFO ] Input system was already deterministic with 456 transitions.
[2025-06-02 14:01:03] [INFO ] Flatten gal took : 30 ms
[2025-06-02 14:01:03] [INFO ] Flatten gal took : 39 ms
[2025-06-02 14:01:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13710641899669823492.gal : 5 ms
[2025-06-02 14:01:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16271116415869905059.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/CTLFireability13710641899669823492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16271116415869905059.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.
Detected timeout of ITS tools.
[2025-06-02 14:01:33] [INFO ] Flatten gal took : 15 ms
[2025-06-02 14:01:33] [INFO ] Applying decomposition
[2025-06-02 14:01:33] [INFO ] Flatten gal took : 16 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/graph4588310050233792523.txt' '-o' '/tmp/graph4588310050233792523.bin' '-w' '/tmp/graph4588310050233792523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4588310050233792523.bin' '-l' '-1' '-v' '-w' '/tmp/graph4588310050233792523.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:01:33] [INFO ] Decomposing Gal with order
[2025-06-02 14:01:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:01:33] [INFO ] Removed a total of 1065 redundant transitions.
[2025-06-02 14:01:33] [INFO ] Flatten gal took : 40 ms
[2025-06-02 14:01:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 8 ms.
[2025-06-02 14:01:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11720121941142042522.gal : 3 ms
[2025-06-02 14:01:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14199214936235406889.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/CTLFireability11720121941142042522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14199214936235406889.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,2.77138e+07,12.0442,231504,4118,516,184292,8145,1082,2.062e+06,165,31875,0


Converting to forward existential form...Done !
original formula: EF(EX(EX(((((i7.u3.p14==1)&&(i5.u8.p39==1))&&((i2.i1.u56.p70==1)&&(i2.i1.u56.p96==1)))&&((i9.u57.p247==1)&&(i3.i0.u22.p114==1))))))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,TRUE))) * ((((i7.u3.p14==1)&&(i5.u8.p39==1))&&((i2.i1.u56.p70==1)&&(i2.i1.u56.p96==1)))&&((i9....201
(forward)formula 0,1,13.0861,231504,1,0,184292,8145,1839,2.062e+06,264,31875,145722
FORMULA MedleyA-PT-17-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Graph (trivial) has 224 edges and 212 vertex of which 9 / 212 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 205 transition count 476
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 176 transition count 476
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 59 place count 176 transition count 463
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 85 place count 163 transition count 463
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 102 place count 146 transition count 433
Iterating global reduction 2 with 17 rules applied. Total rules applied 119 place count 146 transition count 433
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 135 place count 146 transition count 417
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 135 place count 146 transition count 414
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 141 place count 143 transition count 414
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 140 transition count 394
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 140 transition count 394
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 181 place count 123 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 182 place count 123 transition count 376
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 184 place count 121 transition count 362
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 121 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 194 place count 121 transition count 354
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 202 place count 117 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 116 transition count 349
Applied a total of 203 rules in 48 ms. Remains 116 /212 variables (removed 96) and now considering 349/512 (removed 163) transitions.
[2025-06-02 14:01:47] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
// Phase 1: matrix 347 rows 116 cols
[2025-06-02 14:01:47] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:01:47] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 14:01:47] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2025-06-02 14:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:01:47] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-02 14:01:47] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:01:47] [INFO ] Redundant transitions in 2 ms returned []
Running 340 sub problems to find dead transitions.
[2025-06-02 14:01:47] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2025-06-02 14:01:47] [INFO ] Invariant cache hit.
[2025-06-02 14:01:47] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:49] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:49] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:49] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:50] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:50] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:50] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:50] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:51] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:51] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:51] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:51] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:51] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:01:53] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 346/462 variables, 116/136 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 64/200 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 1/463 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 201 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 3 (OVERLAPS) 346/462 variables, 116/136 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 64/200 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 304/504 constraints. Problems are: Problem set: 36 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/463 variables, and 504 constraints, problems are : Problem set: 36 solved, 304 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 304/340 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60185ms problems are : Problem set: 36 solved, 304 unsolved
Search for dead transitions found 36 dead transitions in 60187ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 116/212 places, 313/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 14:02:47] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60683 ms. Remains : 116/212 places, 313/512 transitions.
[2025-06-02 14:02:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 14:02:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 14:02:47] [INFO ] Input system was already deterministic with 313 transitions.
[2025-06-02 14:02:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 14:02:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 14:02:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16337859630547345726.gal : 1 ms
[2025-06-02 14:02:47] [INFO ] Time to serialize properties into /tmp/CTLFireability502384606543495803.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/CTLFireability16337859630547345726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability502384606543495803.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.36642e+06,12.2511,271072,2,41053,5,669272,6,0,777,615933,0


Converting to forward existential form...Done !
original formula: AF(((p43==1)&&(p211==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p43==1)&&(p211==1))))] = FALSE
Hit Full ! (commute/partial/dont) 294/0/19
Detected timeout of ITS tools.
[2025-06-02 14:03:17] [INFO ] Flatten gal took : 8 ms
[2025-06-02 14:03:17] [INFO ] Applying decomposition
[2025-06-02 14:03:17] [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/graph16579276195641269322.txt' '-o' '/tmp/graph16579276195641269322.bin' '-w' '/tmp/graph16579276195641269322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16579276195641269322.bin' '-l' '-1' '-v' '-w' '/tmp/graph16579276195641269322.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:03:17] [INFO ] Decomposing Gal with order
[2025-06-02 14:03:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:03:17] [INFO ] Removed a total of 585 redundant transitions.
[2025-06-02 14:03:17] [INFO ] Flatten gal took : 15 ms
[2025-06-02 14:03:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 11 ms.
[2025-06-02 14:03:17] [INFO ] Time to serialize gal into /tmp/CTLFireability12523107971165520946.gal : 2 ms
[2025-06-02 14:03:17] [INFO ] Time to serialize properties into /tmp/CTLFireability14783323298913839195.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/CTLFireability12523107971165520946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14783323298913839195.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,2.36642e+06,2.18924,48456,702,206,63166,7371,606,199779,109,41393,0


Converting to forward existential form...Done !
original formula: AF(((u4.p43==1)&&(i6.i1.u28.p211==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((u4.p43==1)&&(i6.i1.u28.p211==1))))] = FALSE
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 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,4.59502,71752,1,0,88524,15868,2764,357898,442,96430,224571
FORMULA MedleyA-PT-17-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 192 transition count 479
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 192 transition count 479
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 57 place count 192 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 190 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 190 transition count 458
Applied a total of 61 rules in 6 ms. Remains 190 /212 variables (removed 22) and now considering 458/512 (removed 54) transitions.
// Phase 1: matrix 458 rows 190 cols
[2025-06-02 14:03:22] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:03:22] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-02 14:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:03:22] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-02 14:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:32] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:32] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:33] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:33] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:33] [INFO ] Deduced a trap composed of 95 places in 264 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:33] [INFO ] Deduced a trap composed of 112 places in 269 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:34] [INFO ] Deduced a trap composed of 112 places in 203 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:35] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:35] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:36] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:36] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:36] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:36] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:37] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:37] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:37] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:37] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:38] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:38] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:38] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:40] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:40] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:41] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:41] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:41] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:42] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:42] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:42] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:43] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:43] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:44] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:45] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:45] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:45] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 41 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:58] [INFO ] Deduced a trap composed of 24 places in 338 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:58] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:59] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:59] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:03:59] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:04:04] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:04:04] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:04:08] [INFO ] Deduced a trap composed of 115 places in 293 ms of which 38 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:04:13] [INFO ] Deduced a trap composed of 112 places in 292 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:04:18] [INFO ] Deduced a trap composed of 112 places in 301 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:04:18] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/648 variables, and 52 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 190/212 places, 458/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60692 ms. Remains : 190/212 places, 458/512 transitions.
[2025-06-02 14:04:23] [INFO ] Flatten gal took : 25 ms
[2025-06-02 14:04:23] [INFO ] Flatten gal took : 27 ms
[2025-06-02 14:04:23] [INFO ] Input system was already deterministic with 458 transitions.
[2025-06-02 14:04:23] [INFO ] Flatten gal took : 26 ms
[2025-06-02 14:04:23] [INFO ] Flatten gal took : 27 ms
[2025-06-02 14:04:23] [INFO ] Time to serialize gal into /tmp/CTLFireability10924896419985037022.gal : 4 ms
[2025-06-02 14:04:23] [INFO ] Time to serialize properties into /tmp/CTLFireability88106917036385898.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/CTLFireability10924896419985037022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability88106917036385898.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.
Detected timeout of ITS tools.
[2025-06-02 14:04:53] [INFO ] Flatten gal took : 16 ms
[2025-06-02 14:04:53] [INFO ] Applying decomposition
[2025-06-02 14:04:53] [INFO ] Flatten gal took : 15 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/graph9383336645723627039.txt' '-o' '/tmp/graph9383336645723627039.bin' '-w' '/tmp/graph9383336645723627039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9383336645723627039.bin' '-l' '-1' '-v' '-w' '/tmp/graph9383336645723627039.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:04:53] [INFO ] Decomposing Gal with order
[2025-06-02 14:04:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:04:53] [INFO ] Removed a total of 1078 redundant transitions.
[2025-06-02 14:04:53] [INFO ] Flatten gal took : 29 ms
[2025-06-02 14:04:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 9 ms.
[2025-06-02 14:04:53] [INFO ] Time to serialize gal into /tmp/CTLFireability608894589372559428.gal : 3 ms
[2025-06-02 14:04:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6139389016526177459.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/CTLFireability608894589372559428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6139389016526177459.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 192 transition count 479
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 192 transition count 479
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 57 place count 192 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 189 transition count 456
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 189 transition count 456
Applied a total of 63 rules in 7 ms. Remains 189 /212 variables (removed 23) and now considering 456/512 (removed 56) transitions.
// Phase 1: matrix 456 rows 189 cols
[2025-06-02 14:05:23] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:05:23] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-02 14:05:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:05:24] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2025-06-02 14:05:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:34] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:34] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:34] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:35] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:35] [INFO ] Deduced a trap composed of 95 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:35] [INFO ] Deduced a trap composed of 111 places in 198 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:35] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:37] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:37] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:37] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:38] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:38] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:38] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:38] [INFO ] Deduced a trap composed of 43 places in 224 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:39] [INFO ] Deduced a trap composed of 21 places in 321 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:39] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:39] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:40] [INFO ] Deduced a trap composed of 111 places in 218 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:40] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:40] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:41] [INFO ] Deduced a trap composed of 111 places in 311 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:43] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:43] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:43] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:44] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:44] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:44] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:46] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:46] [INFO ] Deduced a trap composed of 43 places in 239 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:46] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:46] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:53] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:53] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:54] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:54] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:05:54] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 18 ms to minimize.
SMT process timed out in 30394ms, After SMT, problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 30397ms
Starting structural reductions in LTL mode, iteration 1 : 189/212 places, 456/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31243 ms. Remains : 189/212 places, 456/512 transitions.
[2025-06-02 14:05:54] [INFO ] Flatten gal took : 25 ms
[2025-06-02 14:05:54] [INFO ] Flatten gal took : 26 ms
[2025-06-02 14:05:54] [INFO ] Input system was already deterministic with 456 transitions.
[2025-06-02 14:05:54] [INFO ] Flatten gal took : 26 ms
[2025-06-02 14:05:55] [INFO ] Flatten gal took : 26 ms
[2025-06-02 14:05:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18283644259776867375.gal : 4 ms
[2025-06-02 14:05:55] [INFO ] Time to serialize properties into /tmp/CTLFireability13691429102705337316.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/CTLFireability18283644259776867375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13691429102705337316.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.
Detected timeout of ITS tools.
[2025-06-02 14:06:25] [INFO ] Flatten gal took : 16 ms
[2025-06-02 14:06:25] [INFO ] Applying decomposition
[2025-06-02 14:06:25] [INFO ] Flatten gal took : 24 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/graph4045011186844530958.txt' '-o' '/tmp/graph4045011186844530958.bin' '-w' '/tmp/graph4045011186844530958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4045011186844530958.bin' '-l' '-1' '-v' '-w' '/tmp/graph4045011186844530958.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:06:25] [INFO ] Decomposing Gal with order
[2025-06-02 14:06:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:06:25] [INFO ] Removed a total of 1084 redundant transitions.
[2025-06-02 14:06:25] [INFO ] Flatten gal took : 42 ms
[2025-06-02 14:06:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 12 ms.
[2025-06-02 14:06:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8626585216998821581.gal : 5 ms
[2025-06-02 14:06:25] [INFO ] Time to serialize properties into /tmp/CTLFireability7710254643164042332.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/CTLFireability8626585216998821581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7710254643164042332.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,2.77138e+07,16.2944,256080,6645,286,200922,7424,1010,2.23743e+06,145,51528,0


Converting to forward existential form...Done !
original formula: EG(!(A(AF(!(EX((i3.u55.p245==1)))) U EF(AG(((u3.p20==1)&&(i4.u20.p113==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(E(TRUE U !(E(TRUE U !(((u3.p20==1)&&(i4.u20.p113==1))))))) U (!(!(EG(!(!(EX((i3.u55.p245==1)...307
Reverse transition relation is NOT exact ! Due to transitions t20, t97, t155, t168, t170, t172, t184, t186, t188, t212, t220, t244, t252, t262, t263, t270,...927
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 512/512 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 192 transition count 479
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 192 transition count 479
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 57 place count 192 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 189 transition count 456
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 189 transition count 456
Applied a total of 63 rules in 6 ms. Remains 189 /212 variables (removed 23) and now considering 456/512 (removed 56) transitions.
[2025-06-02 14:06:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:06:55] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 14:06:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:06:55] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2025-06-02 14:06:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:05] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 15 places in 276 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 95 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 111 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:09] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:09] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:09] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:09] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:10] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:10] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:10] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:11] [INFO ] Deduced a trap composed of 37 places in 339 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:11] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:11] [INFO ] Deduced a trap composed of 111 places in 219 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:11] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:12] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:13] [INFO ] Deduced a trap composed of 111 places in 306 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:14] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:15] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:15] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:15] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:16] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:16] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:17] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:17] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:18] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:18] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:24] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:25] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:25] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:25] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:26] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 15 ms to minimize.
SMT process timed out in 30324ms, After SMT, problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 30326ms
Starting structural reductions in LTL mode, iteration 1 : 189/212 places, 456/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30914 ms. Remains : 189/212 places, 456/512 transitions.
[2025-06-02 14:07:26] [INFO ] Flatten gal took : 25 ms
[2025-06-02 14:07:26] [INFO ] Flatten gal took : 23 ms
[2025-06-02 14:07:26] [INFO ] Input system was already deterministic with 456 transitions.
[2025-06-02 14:07:26] [INFO ] Flatten gal took : 22 ms
[2025-06-02 14:07:26] [INFO ] Flatten gal took : 22 ms
[2025-06-02 14:07:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10933043700510158446.gal : 4 ms
[2025-06-02 14:07:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13620267875295773833.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/CTLFireability10933043700510158446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13620267875295773833.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.
Detected timeout of ITS tools.
[2025-06-02 14:07:56] [INFO ] Flatten gal took : 15 ms
[2025-06-02 14:07:56] [INFO ] Applying decomposition
[2025-06-02 14:07:56] [INFO ] Flatten gal took : 15 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/graph12046799379306885301.txt' '-o' '/tmp/graph12046799379306885301.bin' '-w' '/tmp/graph12046799379306885301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12046799379306885301.bin' '-l' '-1' '-v' '-w' '/tmp/graph12046799379306885301.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:07:56] [INFO ] Decomposing Gal with order
[2025-06-02 14:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:07:56] [INFO ] Removed a total of 1062 redundant transitions.
[2025-06-02 14:07:56] [INFO ] Flatten gal took : 25 ms
[2025-06-02 14:07:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 7 ms.
[2025-06-02 14:07:56] [INFO ] Time to serialize gal into /tmp/CTLFireability18101418255151553170.gal : 3 ms
[2025-06-02 14:07:56] [INFO ] Time to serialize properties into /tmp/CTLFireability2968150684543253463.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/CTLFireability18101418255151553170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2968150684543253463.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,23.8877,325656,3899,481,200010,18967,1057,2.98144e+06,170,190933,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 14:08:26] [INFO ] Flatten gal took : 25 ms
[2025-06-02 14:08:26] [INFO ] Flatten gal took : 26 ms
[2025-06-02 14:08:26] [INFO ] Applying decomposition
[2025-06-02 14:08:26] [INFO ] Flatten gal took : 27 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/graph4271415600546247156.txt' '-o' '/tmp/graph4271415600546247156.bin' '-w' '/tmp/graph4271415600546247156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4271415600546247156.bin' '-l' '-1' '-v' '-w' '/tmp/graph4271415600546247156.weights' '-q' '0' '-e' '0.001'
[2025-06-02 14:08:26] [INFO ] Decomposing Gal with order
[2025-06-02 14:08:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:08:26] [INFO ] Removed a total of 952 redundant transitions.
[2025-06-02 14:08:26] [INFO ] Flatten gal took : 41 ms
[2025-06-02 14:08:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 8 ms.
[2025-06-02 14:08:26] [INFO ] Time to serialize gal into /tmp/CTLFireability3268656176688184917.gal : 5 ms
[2025-06-02 14:08:26] [INFO ] Time to serialize properties into /tmp/CTLFireability8313201452253950663.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/CTLFireability3268656176688184917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8313201452253950663.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 9 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,4.65293e+07,131.355,1960644,9671,3385,637653,51627,977,2.27862e+07,233,239981,0


Converting to forward existential form...Done !
original formula: A(((i4.u55.p40==1) * !(((((AX((((i10.u6.p27==1)&&(i10.u16.p105==1))&&((i5.i1.u27.p167==1)&&(i10.u54.p242==1)))) * EG((i9.u38.p183==1))) *...769
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(EG(!(((!((i1.u3.p9==1)&&(i6.u28.p154==1)))&&((i1.u4.p20==1)||((((i1.u3.p14==1)&&(i4.u...2906
Reverse transition relation is NOT exact ! Due to transitions t11, t21, t42, t108, t159, t161, t175, t183, t186, t190, t195, t196, t200, t204, t208, t224, ...1480
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-06-02 14:13:45] [INFO ] Applying decomposition
[2025-06-02 14:13:45] [INFO ] Flatten gal took : 19 ms
[2025-06-02 14:13:45] [INFO ] Decomposing Gal with order
[2025-06-02 14:13:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 14:13:45] [INFO ] Removed a total of 934 redundant transitions.
[2025-06-02 14:13:45] [INFO ] Flatten gal took : 28 ms
[2025-06-02 14:13:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 241 labels/synchronizations in 4 ms.
[2025-06-02 14:13:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15785519714564204131.gal : 2 ms
[2025-06-02 14:13:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16903906813231886660.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/CTLFireability15785519714564204131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16903906813231886660.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 9 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,4.65293e+07,2.13547,56248,995,2538,39428,47965,238,185354,529,479111,0


Converting to forward existential form...Done !
original formula: A(((i0.i0.i0.u5.p40==1) * !(((((AX((((i0.i0.i0.u4.p27==1)&&(i0.i0.i1.u8.p105==1))&&((i0.i1.u10.p167==1)&&(u12.p242==1)))) * EG((i0.i1.u11...889
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(EG(!(((!((i0.i0.i0.u4.p9==1)&&(i0.i1.u10.p154==1)))&&((i0.i0.i0.u4.p20==1)||((((i0.i0...3398
Reverse transition relation is NOT exact ! Due to transitions t244, t366, u12.t2, u12.t4, i0.t509, i0.t464, i0.i0.i0.u4.t205, i0.i0.i0.u4.t208, i0.i0.i0.u4...1973
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 1
Fast SCC detection found an SCC at level 2
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 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,0,944.78,4880380,1,0,2.01012e+06,6.10269e+06,836,2.82375e+07,1699,3.43831e+07,519066
FORMULA MedleyA-PT-17-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(!((((((i0.i0.i0.u5.p46==1)&&(i0.i0.i1.u8.p97==1))&&((i0.i1.u11.p232==1)&&(u12.p242==1))) + AF(((i0.i0.i0.u4.p12==1)&&(i0.i1.u11.p214==1...424
=> equivalent forward existential formula: [(FwdU(Init,!((((((i0.i0.i0.u5.p46==1)&&(i0.i0.i1.u8.p97==1))&&((i0.i1.u11.p232==1)&&(u12.p242==1))) + !(EG(!(((...488
(forward)formula 1,1,1377.98,5938428,1,0,2.48008e+06,8.85351e+06,439,3.21363e+07,1382,4.11149e+07,126858
FORMULA MedleyA-PT-17-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

BK_TIME_CONFINEMENT_REACHED

--------------------
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="MedleyA-PT-17"
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 MedleyA-PT-17, 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 r128-smll-174876524200226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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