About the Execution of ITS-Tools for MedleyA-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | TFF?TFFTFTFTTFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000162.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-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K 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 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 99K 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-09-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-09-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748851978510
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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 08:13:01] [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 08:13:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:13:01] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2025-06-02 08:13:01] [INFO ] Transformed 147 places.
[2025-06-02 08:13:01] [INFO ] Transformed 315 transitions.
[2025-06-02 08:13:01] [INFO ] Found NUPN structural information;
[2025-06-02 08:13:01] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 440 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
Support contains 62 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 119 transition count 288
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 119 transition count 288
Applied a total of 50 rules in 61 ms. Remains 119 /145 variables (removed 26) and now considering 288/313 (removed 25) transitions.
// Phase 1: matrix 288 rows 119 cols
[2025-06-02 08:13:01] [INFO ] Computed 10 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:13:02] [INFO ] Implicit Places using invariants in 432 ms returned []
[2025-06-02 08:13:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:13:02] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-02 08:13: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/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/119 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:08] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:09] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:09] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:09] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:09] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:09] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:10] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 7/17 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 288/407 variables, 119/136 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:15] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:15] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:15] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:16] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 4/140 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:22] [INFO ] Deduced a trap along path composed of 2 places in 51 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:23] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:24] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 3/143 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:26] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:26] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:26] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:27] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 27 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 4/147 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 1.0)
(t3 0.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 1.0)
(t8 1.0)
(t9 1.0)
(t10 1.0)
(t11 1.0)
(t12 1.0)
(t13 1.0)
(t14 0.0)
(t15 0.0)
(t16 3.0)
(t17 1.0)
(t18 0.0)
(t19 1.0)
(t20 1.0)
(t21 1.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 1.0)
(t26 1.0)
(t27 0.0)
(t28 2.0)
(t29 1.0)
(t30 0.0)
(t31 1.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 1.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 2.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 1.0)
(t50 1.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 1.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 1.0)
(t62 2.0)
(t63 4.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 1.0)
(t69 1.0)
(t70 1.0)
(t71 1.0)
(t72 0.0)
(t73 1.0)
(t74 1.0)
(t75 0.0)
(t76 2.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 2.0)
(t83 2.0)
(t84 1.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 1.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 1.0)
(t110 1.0)
(t111 1.0)
(t112 1.0)
(t113 0.0)
(t114 1.0)
(t115 0.0)
(t116 0.0)
(t117 1.0)
(t118 1.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 1.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 1.0)
(t153 0.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 1.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 0.0)
(t177 0.0)
(t178 0.0)
(t179 0.0)
(t180 0.0)
(t181 0.0)
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 1.0)
(t188 0.0)
(t189 0.0)
(t190 0.0)
(t191 0.0)
(t192 0.0)
(t193 0.0)
(t194 1.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 0.0)
(t236 0.0)
(t237 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 407/407 variables, and 147 constraints, problems are : Problem set: 64 solved, 223 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 64 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 15/25 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:34] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:34] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/27 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:35] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 1/28 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:37] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 1/29 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:39] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 1/30 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/30 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 288/407 variables, 119/149 constraints. Problems are: Problem set: 64 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 223/372 constraints. Problems are: Problem set: 64 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:46] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:48] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:49] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:49] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:50] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:50] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:51] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:51] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:57] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 9/381 constraints. Problems are: Problem set: 64 solved, 223 unsolved
SMT process timed out in 60917ms, After SMT, problems are : Problem set: 64 solved, 223 unsolved
Search for dead transitions found 64 dead transitions in 60962ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 119/145 places, 224/313 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61942 ms. Remains : 119/145 places, 224/313 transitions.
Support contains 62 out of 119 places after structural reductions.
[2025-06-02 08:14:04] [INFO ] Flatten gal took : 106 ms
[2025-06-02 08:14:04] [INFO ] Flatten gal took : 55 ms
[2025-06-02 08:14:04] [INFO ] Input system was already deterministic with 224 transitions.
Support contains 61 out of 119 places (down from 62) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 79 to 77
RANDOM walk for 40000 steps (1311 resets) in 2659 ms. (15 steps per ms) remains 47/77 properties
BEST_FIRST walk for 4004 steps (25 resets) in 51 ms. (77 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (27 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (28 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (26 resets) in 58 ms. (67 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (27 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (27 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (29 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (26 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (25 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (26 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (29 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (28 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (29 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (29 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (26 resets) in 39 ms. (100 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (27 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (28 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (27 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (28 resets) in 38 ms. (102 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (27 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (28 resets) in 41 ms. (95 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (24 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (27 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (25 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (26 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (26 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (24 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (27 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (28 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (25 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (30 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (26 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (25 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (28 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (30 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (27 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
// Phase 1: matrix 224 rows 119 cols
[2025-06-02 08:14:05] [INFO ] Computed 10 invariants in 10 ms
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/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 2 (OVERLAPS) 35/78 variables, 4/5 constraints. Problems are: Problem set: 12 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 12 solved, 34 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 4 (OVERLAPS) 27/105 variables, 5/10 constraints. Problems are: Problem set: 17 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 17 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 213/318 variables, 105/115 constraints. Problems are: Problem set: 17 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:07] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/116 constraints. Problems are: Problem set: 17 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/116 constraints. Problems are: Problem set: 17 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 17/335 variables, 9/125 constraints. Problems are: Problem set: 17 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 0/125 constraints. Problems are: Problem set: 17 solved, 29 unsolved
Problem AtomicPropp67 is UNSAT
At refinement iteration 11 (OVERLAPS) 8/343 variables, 5/130 constraints. Problems are: Problem set: 18 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:08] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 1/131 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/131 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/131 constraints. Problems are: Problem set: 18 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 131 constraints, problems are : Problem set: 18 solved, 28 unsolved in 3235 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 18 solved, 28 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 18 solved, 28 unsolved
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 2 (OVERLAPS) 37/76 variables, 4/5 constraints. Problems are: Problem set: 20 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 20 solved, 26 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 4 (OVERLAPS) 29/105 variables, 5/10 constraints. Problems are: Problem set: 24 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:09] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/11 constraints. Problems are: Problem set: 24 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:09] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/12 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 213/318 variables, 105/117 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 10/127 constraints. Problems are: Problem set: 24 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:10] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 1/128 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 2/130 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/130 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 17/335 variables, 9/139 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 12/151 constraints. Problems are: Problem set: 24 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:12] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:12] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 2/153 constraints. Problems are: Problem set: 24 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:13] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:13] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 2/155 constraints. Problems are: Problem set: 24 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/343 variables, and 155 constraints, problems are : Problem set: 24 solved, 22 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 114/119 constraints, PredecessorRefiner: 22/46 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 8356ms problems are : Problem set: 24 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 224/224 transitions.
Graph (complete) has 405 edges and 119 vertex of which 116 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 116 transition count 212
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 108 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 107 transition count 211
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 20 place count 107 transition count 205
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 32 place count 101 transition count 205
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 41 place count 92 transition count 192
Iterating global reduction 3 with 9 rules applied. Total rules applied 50 place count 92 transition count 192
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 68 place count 83 transition count 183
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 78 place count 78 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 3 with 31 rules applied. Total rules applied 109 place count 78 transition count 175
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 78 transition count 170
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 119 place count 73 transition count 170
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 127 place count 73 transition count 170
Applied a total of 127 rules in 89 ms. Remains 73 /119 variables (removed 46) and now considering 170/224 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 73/119 places, 170/224 transitions.
RANDOM walk for 40000 steps (3204 resets) in 532 ms. (75 steps per ms) remains 11/22 properties
BEST_FIRST walk for 40003 steps (756 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (764 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (759 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (745 resets) in 115 ms. (344 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (742 resets) in 118 ms. (336 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (720 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (785 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (699 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (768 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (562 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
// Phase 1: matrix 170 rows 73 cols
[2025-06-02 08:14:14] [INFO ] Computed 11 invariants in 8 ms
[2025-06-02 08:14:14] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 29/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 26/72 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 170/242 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/243 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/243 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 92 constraints, problems are : Problem set: 0 solved, 8 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 29/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 26/72 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 170/242 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:15] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/243 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:16] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/243 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 102 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5687 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6174ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 6 properties in 3724 ms.
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 170/170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 162
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 65 transition count 162
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 65 transition count 159
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 62 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 60 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 60 transition count 157
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 45 place count 50 transition count 148
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 44 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 65 place count 44 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 43 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 43 transition count 179
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 43 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 41 transition count 177
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 41 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 40 transition count 177
Applied a total of 75 rules in 72 ms. Remains 40 /73 variables (removed 33) and now considering 177/170 (removed -7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 40/73 places, 177/170 transitions.
RANDOM walk for 26423 steps (4815 resets) in 274 ms. (96 steps per ms) remains 0/2 properties
Successfully simplified 25 atomic propositions for a total of 16 simplifications.
[2025-06-02 08:14:24] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-02 08:14:24] [INFO ] Flatten gal took : 33 ms
[2025-06-02 08:14:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-09-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 08:14:25] [INFO ] Flatten gal took : 32 ms
[2025-06-02 08:14:25] [INFO ] Input system was already deterministic with 224 transitions.
Support contains 42 out of 119 places (down from 53) after GAL structural reductions.
Computed a total of 13 stabilizing places and 15 stable transitions
Graph (complete) has 405 edges and 119 vertex of which 116 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 105 transition count 205
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 105 transition count 205
Applied a total of 28 rules in 11 ms. Remains 105 /119 variables (removed 14) and now considering 205/224 (removed 19) transitions.
// Phase 1: matrix 205 rows 105 cols
[2025-06-02 08:14:25] [INFO ] Computed 10 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:14:25] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 08:14:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:14:25] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-02 08:14:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:28] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:28] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:28] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:28] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:29] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:29] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:33] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:33] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:33] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:36] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:40] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 126 constraints, problems are : Problem set: 0 solved, 204 unsolved in 26251 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/329 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:56] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:56] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:59] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:09] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 334 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56453ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 56456ms
Starting structural reductions in LTL mode, iteration 1 : 105/119 places, 205/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56767 ms. Remains : 105/119 places, 205/224 transitions.
[2025-06-02 08:15:21] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:15:21] [INFO ] Flatten gal took : 17 ms
[2025-06-02 08:15:21] [INFO ] Input system was already deterministic with 205 transitions.
[2025-06-02 08:15:21] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:15:21] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:15:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6749906478922888175.gal : 8 ms
[2025-06-02 08:15:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15289778003818256350.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/CTLFireability6749906478922888175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15289778003818256350.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.16532e+07,1.93361,49200,2,3294,5,144455,6,0,625,202582,0
Converting to forward existential form...Done !
original formula: EG(E(!(EX((AX(FALSE) * ((((p11==1)&&(p58==1))&&((p78==1)&&(p95==1)))||(p47==1))))) U !(AG((p110==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(!(EX((!(EX(!(FALSE))) * ((((p11==1)&&(p58==1))&&((p78==1)&&(p95==1)))||(p47==1))))) U !(!(E(TRUE U ...182
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t31, t32, t33, t36, t38, t40, t44, t45, t46,...417
(forward)formula 0,1,6.97641,138044,1,0,395,549764,437,139,6093,611342,468
FORMULA MedleyA-PT-09-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Graph (complete) has 405 edges and 119 vertex of which 116 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 115 transition count 203
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 98 transition count 199
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 96 transition count 197
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 43 place count 96 transition count 191
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 55 place count 90 transition count 191
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 64 place count 81 transition count 178
Iterating global reduction 3 with 9 rules applied. Total rules applied 73 place count 81 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 73 place count 81 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 80 transition count 177
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 109 place count 62 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 61 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 61 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 116 place count 61 transition count 154
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 3 with 1 rules applied. Total rules applied 117 place count 61 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 118 place count 60 transition count 153
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 118 place count 60 transition count 151
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 122 place count 58 transition count 151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 126 place count 56 transition count 149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 54 transition count 147
Applied a total of 128 rules in 77 ms. Remains 54 /119 variables (removed 65) and now considering 147/224 (removed 77) transitions.
// Phase 1: matrix 147 rows 54 cols
[2025-06-02 08:15:29] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:15:29] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 08:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:15:29] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 08:15:29] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:15:29] [INFO ] Redundant transitions in 7 ms returned []
Running 143 sub problems to find dead transitions.
[2025-06-02 08:15:29] [INFO ] Invariant cache hit.
[2025-06-02 08:15:29] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:31] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:31] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 147/201 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:33] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 81 constraints, problems are : Problem set: 0 solved, 143 unsolved in 8842 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 2/54 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 147/201 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 143/224 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 224 constraints, problems are : Problem set: 0 solved, 143 unsolved in 11049 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20002ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 20004ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/119 places, 147/224 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20343 ms. Remains : 54/119 places, 147/224 transitions.
[2025-06-02 08:15:49] [INFO ] Flatten gal took : 19 ms
[2025-06-02 08:15:49] [INFO ] Flatten gal took : 18 ms
[2025-06-02 08:15:49] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 08:15:49] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:15:49] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:15:49] [INFO ] Time to serialize gal into /tmp/CTLFireability453753461779082292.gal : 6 ms
[2025-06-02 08:15:49] [INFO ] Time to serialize properties into /tmp/CTLFireability11866859147796902355.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/CTLFireability453753461779082292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11866859147796902355.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,579870,0.35433,12528,2,895,5,29064,6,0,359,34404,0
Converting to forward existential form...Done !
original formula: AG((AG((p92==0)) + !(A(((p16==1) * AF((p49==1))) U (p41==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(!((E(!((p41==1)) U (!(((p16==1) * !(EG(!((p49==1)))))) * !((p41==1)))) + EG(!((p41...196
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t8, t10, t11, t13, t15, t16, t17, t18, t20, t22, t23, t25, t29, t30, t32, t43...326
(forward)formula 0,0,22.8002,553488,1,0,701,3.17988e+06,327,283,3404,2.96142e+06,860
FORMULA MedleyA-PT-09-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 108 transition count 210
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 108 transition count 210
Applied a total of 22 rules in 8 ms. Remains 108 /119 variables (removed 11) and now considering 210/224 (removed 14) transitions.
// Phase 1: matrix 210 rows 108 cols
[2025-06-02 08:16:12] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:16:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 08:16:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:16:12] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2025-06-02 08:16:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:16] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:16] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:16] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:16] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:16] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:17] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:17] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/318 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:21] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:21] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:21] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:22] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:22] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/318 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 130 constraints, problems are : Problem set: 0 solved, 209 unsolved in 21023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/318 variables, 108/130 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 209/339 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:40] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:48] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:48] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:55] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:56] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 344 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51124ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 51126ms
Starting structural reductions in LTL mode, iteration 1 : 108/119 places, 210/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51378 ms. Remains : 108/119 places, 210/224 transitions.
[2025-06-02 08:17:03] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:17:03] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:17:03] [INFO ] Input system was already deterministic with 210 transitions.
[2025-06-02 08:17:04] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:17:04] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:17:04] [INFO ] Time to serialize gal into /tmp/CTLFireability2837666159122945777.gal : 9 ms
[2025-06-02 08:17:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2578867215548111297.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/CTLFireability2837666159122945777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2578867215548111297.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.75669e+07,3.60437,89628,2,5745,5,236331,6,0,642,348909,0
Converting to forward existential form...Done !
original formula: E(!((A((p63==1) U ((AX((((p19==1)&&(p58==1))&&((p121==1)&&(p143==1)))) + (p50==1)) + ((p106==1)||(p107==1)))) * (p41==1))) U (((E((((p78=...247
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,!((!((E(!(((!(EX(!((((p19==1)&&(p58==1))&&((p121==1)&&(p143==1)))))) + (p50==1)) + ((p106==1...533
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t34, t35, t37, t39, t40, t41,...457
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 08:17:34] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:17:34] [INFO ] Applying decomposition
[2025-06-02 08:17:34] [INFO ] Flatten gal took : 10 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/graph13836567029852021809.txt' '-o' '/tmp/graph13836567029852021809.bin' '-w' '/tmp/graph13836567029852021809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13836567029852021809.bin' '-l' '-1' '-v' '-w' '/tmp/graph13836567029852021809.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:17:34] [INFO ] Decomposing Gal with order
[2025-06-02 08:17:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:17:34] [INFO ] Removed a total of 346 redundant transitions.
[2025-06-02 08:17:34] [INFO ] Flatten gal took : 108 ms
[2025-06-02 08:17:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 27 ms.
[2025-06-02 08:17:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16572052424461632960.gal : 9 ms
[2025-06-02 08:17:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5674972359992773097.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/CTLFireability16572052424461632960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5674972359992773097.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,5.75669e+07,0.595748,16696,868,188,19962,1590,446,59870,115,10115,0
Converting to forward existential form...Done !
original formula: E(!((A((i3.u15.p63==1) U ((AX((((i2.i1.u2.p19==1)&&(i2.i1.u2.p58==1))&&((i3.u27.p121==1)&&(i2.i1.u2.p143==1)))) + (i2.i1.u12.p50==1)) + (...372
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,!((!((E(!(((!(EX(!((((i2.i1.u2.p19==1)&&(i2.i1.u2.p58==1))&&((i3.u27.p121==1)&&(i2.i1.u2.p14...774
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t33, i0.u1.t99, i0.u3.t96, i1.t89, i1.t88, i1.t87, i1.t84, i1.t83, i1.u5.t91, i1.u5....748
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 7
Fast SCC detection found an SCC at level 8
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 105 transition count 206
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 105 transition count 206
Applied a total of 28 rules in 5 ms. Remains 105 /119 variables (removed 14) and now considering 206/224 (removed 18) transitions.
// Phase 1: matrix 206 rows 105 cols
[2025-06-02 08:18:04] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:18:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 08:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:18:04] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2025-06-02 08:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:07] [INFO ] Deduced a trap composed of 21 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 08:18:07] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:08] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:08] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:08] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:08] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:12] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:12] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:12] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:12] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:15] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:16] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:18] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/311 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 128 constraints, problems are : Problem set: 0 solved, 205 unsolved in 21585 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/126 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 205/331 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:29] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:29] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:31] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:36] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:42] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:42] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 339 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51695ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 51695ms
Starting structural reductions in LTL mode, iteration 1 : 105/119 places, 206/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51963 ms. Remains : 105/119 places, 206/224 transitions.
[2025-06-02 08:18:56] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:18:56] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:18:56] [INFO ] Input system was already deterministic with 206 transitions.
[2025-06-02 08:18:56] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:18:56] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:18:56] [INFO ] Time to serialize gal into /tmp/CTLFireability4359877146794866392.gal : 3 ms
[2025-06-02 08:18:56] [INFO ] Time to serialize properties into /tmp/CTLFireability18068028852332133602.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/CTLFireability4359877146794866392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18068028852332133602.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,4.8158e+07,1.90063,47568,2,3323,5,137704,6,0,626,193911,0
Converting to forward existential form...Done !
original formula: EG(EX(E(AF((p45==1)) U AG((p115==1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(E(!(EG(!((p45==1)))) U !(E(TRUE U !((p115==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...422
Detected timeout of ITS tools.
[2025-06-02 08:19:26] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:19:26] [INFO ] Applying decomposition
[2025-06-02 08:19:26] [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/graph6066797274324355940.txt' '-o' '/tmp/graph6066797274324355940.bin' '-w' '/tmp/graph6066797274324355940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6066797274324355940.bin' '-l' '-1' '-v' '-w' '/tmp/graph6066797274324355940.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:19:26] [INFO ] Decomposing Gal with order
[2025-06-02 08:19:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:19:26] [INFO ] Removed a total of 343 redundant transitions.
[2025-06-02 08:19:26] [INFO ] Flatten gal took : 28 ms
[2025-06-02 08:19:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 7 ms.
[2025-06-02 08:19:26] [INFO ] Time to serialize gal into /tmp/CTLFireability14347636019474981898.gal : 3 ms
[2025-06-02 08:19:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5873121809571037212.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/CTLFireability14347636019474981898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5873121809571037212.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,4.8158e+07,0.185381,7912,404,118,7357,954,330,14384,106,3928,0
Converting to forward existential form...Done !
original formula: EG(EX(E(AF((i3.u12.p45==1)) U AG((i6.u25.p115==1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(E(!(EG(!((i3.u12.p45==1)))) U !(E(TRUE U !((i6.u25.p115==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t24, i1.u2.t95, i1.u5.t92, i2.t85, i2.t84, i2.t83, i2.t79, i2.u6.t60, i2.u6.t90, i2.u6.t9...690
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 7
(forward)formula 0,0,7.9832,229520,1,0,338991,25270,1924,1.25775e+06,493,175802,267101
FORMULA MedleyA-PT-09-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Graph (complete) has 405 edges and 119 vertex of which 116 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 115 transition count 203
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 19 rules applied. Total rules applied 37 place count 98 transition count 201
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 97 transition count 199
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 96 transition count 198
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 42 place count 96 transition count 193
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 52 place count 91 transition count 193
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 64 place count 79 transition count 175
Iterating global reduction 4 with 12 rules applied. Total rules applied 76 place count 79 transition count 175
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 4 with 1 rules applied. Total rules applied 77 place count 79 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 78 place count 78 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 78 place count 78 transition count 172
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 82 place count 76 transition count 172
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 112 place count 60 transition count 158
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 59 transition count 156
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 59 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 120 place count 59 transition count 150
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 122 place count 59 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 124 place count 57 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 124 place count 57 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 128 place count 55 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 132 place count 53 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 134 place count 51 transition count 142
Applied a total of 134 rules in 49 ms. Remains 51 /119 variables (removed 68) and now considering 142/224 (removed 82) transitions.
// Phase 1: matrix 142 rows 51 cols
[2025-06-02 08:19:34] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:19:34] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 08:19:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:19:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 08:19:35] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:19:35] [INFO ] Redundant transitions in 5 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-02 08:19:35] [INFO ] Invariant cache hit.
[2025-06-02 08:19:35] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 142/193 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 75 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5815 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 142/193 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 136/211 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 211 constraints, problems are : Problem set: 0 solved, 136 unsolved in 13205 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19090ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 19092ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/119 places, 142/224 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19330 ms. Remains : 51/119 places, 142/224 transitions.
[2025-06-02 08:19:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:19:54] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:19:54] [INFO ] Input system was already deterministic with 142 transitions.
[2025-06-02 08:19:54] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:19:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:19:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5274765543022007004.gal : 2 ms
[2025-06-02 08:19:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12833480487644560227.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5274765543022007004.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12833480487644560227.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (5123 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (1016 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality12833480487644560227.prop.
Finished probabilistic random walk after 5895 steps, run visited all 1 properties in 37 ms. (steps per millisecond=159 )
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
Probabilistic random walk after 5895 steps, saw 1639 distinct states, run finished after 44 ms. (steps per millisecond=133 ) properties seen :1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
FORMULA MedleyA-PT-09-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 62
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :62 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 2042
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Graph (complete) has 405 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 116 transition count 203
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 98 transition count 199
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 96 transition count 197
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 45 place count 96 transition count 192
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 91 transition count 192
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 67 place count 79 transition count 174
Iterating global reduction 3 with 12 rules applied. Total rules applied 79 place count 79 transition count 174
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 3 with 1 rules applied. Total rules applied 80 place count 79 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 78 transition count 173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 81 place count 78 transition count 171
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 85 place count 76 transition count 171
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 117 place count 59 transition count 156
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 118 place count 58 transition count 154
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 58 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 125 place count 58 transition count 148
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 127 place count 58 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 129 place count 56 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 129 place count 56 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 133 place count 54 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 137 place count 52 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 139 place count 50 transition count 140
Applied a total of 139 rules in 63 ms. Remains 50 /119 variables (removed 69) and now considering 140/224 (removed 84) transitions.
// Phase 1: matrix 140 rows 50 cols
[2025-06-02 08:19:54] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:19:54] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-02 08:19:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:19:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 08:19:54] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:19:54] [INFO ] Redundant transitions in 7 ms returned []
Running 134 sub problems to find dead transitions.
[2025-06-02 08:19:54] [INFO ] Invariant cache hit.
[2025-06-02 08:19:54] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 140/190 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 74 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5506 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 140/190 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 134/208 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 208 constraints, problems are : Problem set: 0 solved, 134 unsolved in 10477 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16059ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 16060ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/119 places, 140/224 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16353 ms. Remains : 50/119 places, 140/224 transitions.
[2025-06-02 08:20:10] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:20:10] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:20:10] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-02 08:20:10] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:20:10] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:20:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11939852844984798921.gal : 2 ms
[2025-06-02 08:20:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17015287959497741218.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/CTLFireability11939852844984798921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17015287959497741218.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,496625,0.152107,7760,2,343,5,15574,6,0,335,15974,0
Converting to forward existential form...Done !
original formula: AG(AF((p125==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p125==1)))] = FALSE
Hit Full ! (commute/partial/dont) 129/0/11
(forward)formula 0,0,0.341381,10960,1,0,10,37399,20,3,2418,28930,8
FORMULA MedleyA-PT-09-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Graph (complete) has 405 edges and 119 vertex of which 116 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 115 transition count 205
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 17 rules applied. Total rules applied 33 place count 100 transition count 203
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 99 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 98 transition count 201
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 37 place count 98 transition count 195
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 49 place count 92 transition count 195
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 60 place count 81 transition count 179
Iterating global reduction 4 with 11 rules applied. Total rules applied 71 place count 81 transition count 179
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 4 with 1 rules applied. Total rules applied 72 place count 81 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 73 place count 80 transition count 178
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 23 rules applied. Total rules applied 96 place count 68 transition count 167
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 97 place count 67 transition count 165
Iterating global reduction 6 with 1 rules applied. Total rules applied 98 place count 67 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 106 place count 67 transition count 157
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 3 rules applied. Total rules applied 109 place count 67 transition count 154
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 112 place count 64 transition count 154
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 112 place count 64 transition count 151
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 118 place count 61 transition count 151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 122 place count 59 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 123 place count 58 transition count 148
Applied a total of 123 rules in 31 ms. Remains 58 /119 variables (removed 61) and now considering 148/224 (removed 76) transitions.
// Phase 1: matrix 148 rows 58 cols
[2025-06-02 08:20:11] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:11] [INFO ] Implicit Places using invariants in 59 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/119 places, 148/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 96 ms. Remains : 57/119 places, 148/224 transitions.
[2025-06-02 08:20:11] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:20:11] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:20:11] [INFO ] Input system was already deterministic with 148 transitions.
[2025-06-02 08:20:11] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:20:11] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:20:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14598901066197375367.gal : 2 ms
[2025-06-02 08:20:11] [INFO ] Time to serialize properties into /tmp/CTLFireability16723885458638972454.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/CTLFireability14598901066197375367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16723885458638972454.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.67032e+06,0.341469,12340,2,1026,5,34582,6,0,376,35741,0
Converting to forward existential form...Done !
original formula: A(EG(((p144==1)&&(p146==1))) U ((p107==1) + EG(EF(((((p19==1)&&(p24==1))&&((p121==1)&&(p143==1)))||(((p78==1)&&(p97==1))&&(p113==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(((p107==1) + EG(E(TRUE U ((((p19==1)&&(p24==1))&&((p121==1)&&(p143==1)))||(((p78==1)&&(p97==1))...460
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t6, t8, t9, t11, t12, t13, t14, t17, t18, t19, t21, t22, t23, t26, t27, t29, ...434
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 08:20:41] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:20:41] [INFO ] Applying decomposition
[2025-06-02 08:20:41] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7259053753146094393.txt' '-o' '/tmp/graph7259053753146094393.bin' '-w' '/tmp/graph7259053753146094393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7259053753146094393.bin' '-l' '-1' '-v' '-w' '/tmp/graph7259053753146094393.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:20:41] [INFO ] Decomposing Gal with order
[2025-06-02 08:20:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:20:41] [INFO ] Removed a total of 371 redundant transitions.
[2025-06-02 08:20:41] [INFO ] Flatten gal took : 18 ms
[2025-06-02 08:20:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2025-06-02 08:20:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3504175100185866049.gal : 1 ms
[2025-06-02 08:20:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8141743211735162611.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/CTLFireability3504175100185866049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8141743211735162611.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,1.67032e+06,0.074111,6076,185,83,4133,368,228,9207,77,2624,0
Converting to forward existential form...Done !
original formula: A(EG(((i4.u15.p144==1)&&(i4.u16.p146==1))) U ((i3.u8.p107==1) + EG(EF(((((i0.u0.p19==1)&&(i4.u1.p24==1))&&((i4.u11.p121==1)&&(i4.u15.p143...220
=> equivalent forward existential formula: [((Init * !(EG(!(((i3.u8.p107==1) + EG(E(TRUE U ((((i0.u0.p19==1)&&(i4.u1.p24==1))&&((i4.u11.p121==1)&&(i4.u15.p...627
Reverse transition relation is NOT exact ! Due to transitions t39, t41, t47, t49, t55, t57, t141, t143, t145, t147, i0.u2.t17, i0.u2.t29, i0.u2.t30, i0.u2....530
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
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
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
(forward)formula 0,1,2.41156,70588,1,0,96973,1794,1300,349365,381,14905,102000
FORMULA MedleyA-PT-09-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Graph (complete) has 405 edges and 119 vertex of which 116 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 115 transition count 205
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 100 transition count 201
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 98 transition count 199
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 39 place count 98 transition count 192
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 53 place count 91 transition count 192
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 66 place count 78 transition count 173
Iterating global reduction 3 with 13 rules applied. Total rules applied 79 place count 78 transition count 173
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 3 with 1 rules applied. Total rules applied 80 place count 78 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 77 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 81 place count 77 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 76 transition count 171
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 84 place count 75 transition count 169
Iterating global reduction 5 with 1 rules applied. Total rules applied 85 place count 75 transition count 169
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 106 place count 64 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 112 place count 64 transition count 153
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 114 place count 64 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 116 place count 62 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 116 place count 62 transition count 149
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 120 place count 60 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 124 place count 58 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 125 place count 57 transition count 146
Applied a total of 125 rules in 30 ms. Remains 57 /119 variables (removed 62) and now considering 146/224 (removed 78) transitions.
// Phase 1: matrix 146 rows 57 cols
[2025-06-02 08:20:43] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:43] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 08:20:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 08:20:44] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:20:44] [INFO ] Redundant transitions in 5 ms returned []
Running 138 sub problems to find dead transitions.
[2025-06-02 08:20:44] [INFO ] Invariant cache hit.
[2025-06-02 08:20:44] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 3/56 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 1/203 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 74 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7444 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 3/56 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 138/211 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:56] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 1/203 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (OVERLAPS) 0/203 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 213 constraints, problems are : Problem set: 0 solved, 138 unsolved in 27559 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35126ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 35127ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/119 places, 146/224 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35367 ms. Remains : 57/119 places, 146/224 transitions.
[2025-06-02 08:21:19] [INFO ] Flatten gal took : 17 ms
[2025-06-02 08:21:19] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:21:19] [INFO ] Input system was already deterministic with 146 transitions.
[2025-06-02 08:21:19] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:21:19] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:21:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11406444659347472744.gal : 3 ms
[2025-06-02 08:21:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1261501643870359281.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/CTLFireability11406444659347472744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1261501643870359281.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00162e+06,0.357157,10060,2,516,5,23374,6,0,373,25092,0
Converting to forward existential form...Done !
original formula: AF((EF((((p11==0)||(p24==0))||((p121==0)||(p143==0)))) * AF(AG((((p78==1)&&(p117==1))&&((p121==1)&&(p141==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (((p11==0)||(p24==0))||((p121==0)||(p143==0)))) * !(EG(!(!(E(TRUE U !((((p78==1)&&(p117==...201
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t6, t7, t8, t11, t13, t15, t20, t21, t23, t24, t25, t28, t29, t31, t38, t39, t40,...384
(forward)formula 0,0,11.5537,264436,1,0,465,1.5074e+06,320,195,3998,1.32825e+06,534
FORMULA MedleyA-PT-09-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 104 transition count 204
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 104 transition count 204
Applied a total of 30 rules in 2 ms. Remains 104 /119 variables (removed 15) and now considering 204/224 (removed 20) transitions.
// Phase 1: matrix 204 rows 104 cols
[2025-06-02 08:21:30] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:21:31] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-02 08:21:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:21:31] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-06-02 08:21:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:34] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:34] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:34] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:34] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:35] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:35] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:39] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:39] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:39] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:39] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:44] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:45] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 126 constraints, problems are : Problem set: 0 solved, 203 unsolved in 24030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/327 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:59] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:00] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:00] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54118ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 54119ms
Starting structural reductions in LTL mode, iteration 1 : 104/119 places, 204/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54375 ms. Remains : 104/119 places, 204/224 transitions.
[2025-06-02 08:22:25] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:22:25] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:22:25] [INFO ] Input system was already deterministic with 204 transitions.
[2025-06-02 08:22:25] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:22:25] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:22:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12365940817004120506.gal : 4 ms
[2025-06-02 08:22:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16031265911244490778.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/CTLFireability12365940817004120506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16031265911244490778.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.81538e+07,2.06196,46628,2,3216,5,135037,6,0,620,189146,0
Converting to forward existential form...Done !
original formula: EX(EX(TRUE))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] != FALSE
(forward)formula 0,1,2.06974,46628,1,0,7,135037,7,1,859,189146,2
FORMULA MedleyA-PT-09-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Graph (complete) has 405 edges and 119 vertex of which 116 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 115 transition count 203
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 19 rules applied. Total rules applied 37 place count 98 transition count 201
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 97 transition count 199
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 96 transition count 198
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 42 place count 96 transition count 193
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 52 place count 91 transition count 193
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 64 place count 79 transition count 175
Iterating global reduction 4 with 12 rules applied. Total rules applied 76 place count 79 transition count 175
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 4 with 1 rules applied. Total rules applied 77 place count 79 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 78 place count 78 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 78 place count 78 transition count 172
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 82 place count 76 transition count 172
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 112 place count 60 transition count 158
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 59 transition count 156
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 59 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 120 place count 59 transition count 150
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 122 place count 59 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 124 place count 57 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 124 place count 57 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 128 place count 55 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 132 place count 53 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 134 place count 51 transition count 142
Applied a total of 134 rules in 26 ms. Remains 51 /119 variables (removed 68) and now considering 142/224 (removed 82) transitions.
// Phase 1: matrix 142 rows 51 cols
[2025-06-02 08:22:27] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:22:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 08:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:22:27] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 08:22:27] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:22:27] [INFO ] Redundant transitions in 2 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-02 08:22:27] [INFO ] Invariant cache hit.
[2025-06-02 08:22:27] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 142/193 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 75 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5989 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 142/193 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 136/211 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 211 constraints, problems are : Problem set: 0 solved, 136 unsolved in 15128 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21166ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 21166ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/119 places, 142/224 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21375 ms. Remains : 51/119 places, 142/224 transitions.
[2025-06-02 08:22:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 08:22:48] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:22:48] [INFO ] Input system was already deterministic with 142 transitions.
[2025-06-02 08:22:48] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:22:48] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:22:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality970571784091354124.gal : 1 ms
[2025-06-02 08:22:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5544018032260365931.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality970571784091354124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5544018032260365931.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality5544018032260365931.prop.
RANDOM walk for 40000 steps (5134 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 34
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :34 after 66
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :66 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 1605
BEST_FIRST walk for 39104 steps (961 resets) in 68 ms. (566 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-09-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1605 after 16420
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 104 transition count 204
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 104 transition count 204
Applied a total of 30 rules in 4 ms. Remains 104 /119 variables (removed 15) and now considering 204/224 (removed 20) transitions.
// Phase 1: matrix 204 rows 104 cols
[2025-06-02 08:22:48] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:22:49] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 08:22:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:22:49] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-06-02 08:22:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:51] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:51] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:52] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:52] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:52] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:52] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:54] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:55] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:55] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:55] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:59] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:00] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 126 constraints, problems are : Problem set: 0 solved, 203 unsolved in 22424 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/327 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:16] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:16] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:17] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52574ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 52576ms
Starting structural reductions in LTL mode, iteration 1 : 104/119 places, 204/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52836 ms. Remains : 104/119 places, 204/224 transitions.
[2025-06-02 08:23:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:23:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:23:41] [INFO ] Input system was already deterministic with 204 transitions.
[2025-06-02 08:23:41] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:23:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:23:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13455074897223614601.gal : 1 ms
[2025-06-02 08:23:41] [INFO ] Time to serialize properties into /tmp/CTLFireability726079634068935755.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/CTLFireability13455074897223614601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability726079634068935755.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,4.81538e+07,1.79015,46820,2,3216,5,135037,6,0,620,189146,0
Converting to forward existential form...Done !
original formula: ((AX(FALSE) * AF(((((p19==1)&&(p58==1))&&((p121==1)&&(p139==1)))||(((p19==1)&&(p36==1))&&((p70==1)&&(p83==1)))))) * EG(EF((p94!=1))))
=> equivalent forward existential formula: (([(EY(Init) * !(FALSE))] = FALSE * [FwdG(Init,!(((((p19==1)&&(p58==1))&&((p121==1)&&(p139==1)))||(((p19==1)&&(p...246
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...417
Detected timeout of ITS tools.
[2025-06-02 08:24:11] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:24:11] [INFO ] Applying decomposition
[2025-06-02 08:24:11] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17577174334548489087.txt' '-o' '/tmp/graph17577174334548489087.bin' '-w' '/tmp/graph17577174334548489087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17577174334548489087.bin' '-l' '-1' '-v' '-w' '/tmp/graph17577174334548489087.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:24:11] [INFO ] Decomposing Gal with order
[2025-06-02 08:24:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:24:11] [INFO ] Removed a total of 329 redundant transitions.
[2025-06-02 08:24:11] [INFO ] Flatten gal took : 18 ms
[2025-06-02 08:24:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 5 ms.
[2025-06-02 08:24:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15112740909074956614.gal : 2 ms
[2025-06-02 08:24:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3951836153978768945.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/CTLFireability15112740909074956614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3951836153978768945.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,4.81538e+07,0.129688,7880,509,135,7325,1009,343,14934,100,3474,0
Converting to forward existential form...Done !
original formula: ((AX(FALSE) * AF(((((i1.u2.p19==1)&&(i1.u2.p58==1))&&((i6.i1.u27.p121==1)&&(i1.u2.p139==1)))||(((i1.u2.p19==1)&&(i0.u8.p36==1))&&((i3.u13...212
=> equivalent forward existential formula: (([(EY(Init) * !(FALSE))] = FALSE * [FwdG(Init,!(((((i1.u2.p19==1)&&(i1.u2.p58==1))&&((i6.i1.u27.p121==1)&&(i1.u...307
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t62, i0.t81, i0.t77, i0.u5.t60, i0.u5.t88, i0.u5.t89, i0.u6.t85, i0.u6.t86, i0.u6.t8...673
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 6
(forward)formula 0,0,24.3321,567840,1,0,813201,16279,2021,3.46179e+06,555,141927,639797
FORMULA MedleyA-PT-09-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Graph (complete) has 405 edges and 119 vertex of which 116 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 115 transition count 202
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 97 transition count 198
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 95 transition count 196
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 45 place count 95 transition count 191
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 90 transition count 191
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 66 place count 79 transition count 174
Iterating global reduction 3 with 11 rules applied. Total rules applied 77 place count 79 transition count 174
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 3 with 1 rules applied. Total rules applied 78 place count 79 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 78 transition count 173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 79 place count 78 transition count 171
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 83 place count 76 transition count 171
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 31 rules applied. Total rules applied 114 place count 60 transition count 156
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 115 place count 59 transition count 154
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 59 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 122 place count 59 transition count 148
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 124 place count 59 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 126 place count 57 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 126 place count 57 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 130 place count 55 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 134 place count 53 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 136 place count 51 transition count 140
Applied a total of 136 rules in 19 ms. Remains 51 /119 variables (removed 68) and now considering 140/224 (removed 84) transitions.
// Phase 1: matrix 140 rows 51 cols
[2025-06-02 08:24:36] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:24:36] [INFO ] Implicit Places using invariants in 74 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/119 places, 140/224 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 97 ms. Remains : 50/119 places, 140/224 transitions.
[2025-06-02 08:24:36] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:24:36] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:24:36] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-02 08:24:36] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:24:36] [INFO ] Flatten gal took : 4 ms
[2025-06-02 08:24:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7661231391139823591.gal : 1 ms
[2025-06-02 08:24:36] [INFO ] Time to serialize properties into /tmp/CTLFireability10398676209439070673.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/CTLFireability7661231391139823591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10398676209439070673.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,360092,0.155854,8152,2,511,5,16849,6,0,338,17163,0
Converting to forward existential form...Done !
original formula: EG(AF((p23==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p23==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t14, t15, t28, t31, t104, t128, t130, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,9.52434,240704,1,0,470,1.27963e+06,307,189,3183,1.25791e+06,639
FORMULA MedleyA-PT-09-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 224/224 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 105 transition count 205
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 105 transition count 205
Applied a total of 28 rules in 2 ms. Remains 105 /119 variables (removed 14) and now considering 205/224 (removed 19) transitions.
// Phase 1: matrix 205 rows 105 cols
[2025-06-02 08:24:46] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:24:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 08:24:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:24:46] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-02 08:24:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:49] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:49] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:50] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:50] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:50] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:50] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:54] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:54] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:54] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:55] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:55] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:59] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:01] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 128 constraints, problems are : Problem set: 0 solved, 204 unsolved in 25183 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/330 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:15] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:15] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:16] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:16] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:16] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:23] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:32] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 22 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 204 unsolved
SMT process timed out in 55330ms, After SMT, problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 55331ms
Starting structural reductions in LTL mode, iteration 1 : 105/119 places, 205/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55556 ms. Remains : 105/119 places, 205/224 transitions.
[2025-06-02 08:25:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:25:41] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:25:41] [INFO ] Input system was already deterministic with 205 transitions.
[2025-06-02 08:25:41] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:25:41] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:25:41] [INFO ] Time to serialize gal into /tmp/CTLFireability10128301345649903110.gal : 2 ms
[2025-06-02 08:25:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6149672482150243841.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/CTLFireability10128301345649903110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6149672482150243841.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.62191e+07,2.97233,68784,2,4973,5,206289,6,0,625,290925,0
Converting to forward existential form...Done !
original formula: ((EF((A((((p19==1)&&(p58==1))&&((p121==1)&&(p143==1))) U (((p70==1)&&(p83==1))&&((p121==1)&&(p145==1)))) + EX((p77==1)))) + A(EX(EF((((p1...346
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U (!((E(!((((p70==1)&&(p83==1))&&((p121==1)&&(p145==1)))) U (!((((p19==1)&&(p58==1))&&((...658
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...437
Detected timeout of ITS tools.
[2025-06-02 08:26:11] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:26:11] [INFO ] Applying decomposition
[2025-06-02 08:26:11] [INFO ] Flatten gal took : 5 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/graph12221439325309368991.txt' '-o' '/tmp/graph12221439325309368991.bin' '-w' '/tmp/graph12221439325309368991.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12221439325309368991.bin' '-l' '-1' '-v' '-w' '/tmp/graph12221439325309368991.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:26:11] [INFO ] Decomposing Gal with order
[2025-06-02 08:26:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:26:11] [INFO ] Removed a total of 351 redundant transitions.
[2025-06-02 08:26:11] [INFO ] Flatten gal took : 21 ms
[2025-06-02 08:26:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 5 ms.
[2025-06-02 08:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8875294393726470588.gal : 2 ms
[2025-06-02 08:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability16793104120847912401.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/CTLFireability8875294393726470588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16793104120847912401.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,5.62191e+07,0.22674,10464,547,132,11393,1426,328,28684,92,7386,0
Converting to forward existential form...Done !
original formula: ((EF((A((((i3.u3.p19==1)&&(i3.u3.p58==1))&&((i7.i0.u27.p121==1)&&(i7.i0.u33.p143==1))) U (((i4.u15.p70==1)&&(i4.u17.p83==1))&&((i7.i0.u27...527
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U (!((E(!((((i4.u15.p70==1)&&(i4.u17.p83==1))&&((i7.i0.u27.p121==1)&&(i7.i0.u34.p145==1)...961
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t63, i1.u2.t94, i1.u4.t91, i2.t84, i2.t83, i2.t82, i2.t79, i2.t78, i2.u6.t61, i2.u6....707
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 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 08:26:42] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:26:42] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:26:42] [INFO ] Applying decomposition
[2025-06-02 08:26:42] [INFO ] Flatten gal took : 5 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/graph12209669642011090178.txt' '-o' '/tmp/graph12209669642011090178.bin' '-w' '/tmp/graph12209669642011090178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12209669642011090178.bin' '-l' '-1' '-v' '-w' '/tmp/graph12209669642011090178.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:26:42] [INFO ] Decomposing Gal with order
[2025-06-02 08:26:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:26:42] [INFO ] Removed a total of 397 redundant transitions.
[2025-06-02 08:26:42] [INFO ] Flatten gal took : 19 ms
[2025-06-02 08:26:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 4 ms.
[2025-06-02 08:26:42] [INFO ] Time to serialize gal into /tmp/CTLFireability1318602718366551019.gal : 2 ms
[2025-06-02 08:26:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15216166701874453335.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/CTLFireability1318602718366551019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15216166701874453335.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 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15543e+08,7.35762,178144,2238,897,193204,34924,499,1.24336e+06,141,490773,0
Converting to forward existential form...Done !
original formula: E(!((A((i7.u14.p63==1) U ((AX((((i3.u2.p19==1)&&(i3.u11.p58==1))&&((i7.u28.p121==1)&&(i3.u34.p143==1)))) + (i3.u13.p50==1)) + ((i6.u24.p1...356
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,!((!((E(!(((!(EX(!((((i3.u2.p19==1)&&(i3.u11.p58==1))&&((i7.u28.p121==1)&&(i3.u34.p143==1)))...738
Reverse transition relation is NOT exact ! Due to transitions t7, t27, t44, i0.u1.t113, i0.u3.t107, i0.u3.t108, i1.i1.t15, i1.i1.u30.t14, i2.t100, i2.t99, ...907
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
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
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 8
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
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
(forward)formula 0,1,569.103,2756292,1,0,2.96112e+06,50017,1407,2.18922e+07,377,749812,1825883
FORMULA MedleyA-PT-09-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: ((EF((A((((i3.u2.p19==1)&&(i3.u11.p58==1))&&((i7.u28.p121==1)&&(i3.u34.p143==1))) U (((i4.u15.p70==1)&&(i4.u17.p83==1))&&((i7.u28.p121==1...504
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U (!((E(!((((i4.u15.p70==1)&&(i4.u17.p83==1))&&((i7.u28.p121==1)&&(i7.u16.p145==1)))) U ...914
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
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
ITS-tools command line returned an error code 139
[2025-06-02 08:50:38] [INFO ] Applying decomposition
[2025-06-02 08:50:38] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:50:38] [INFO ] Decomposing Gal with order
[2025-06-02 08:50:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:50:38] [INFO ] Removed a total of 334 redundant transitions.
[2025-06-02 08:50:38] [INFO ] Flatten gal took : 24 ms
[2025-06-02 08:50:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 5 ms.
[2025-06-02 08:50:38] [INFO ] Time to serialize gal into /tmp/CTLFireability18047692334503572036.gal : 3 ms
[2025-06-02 08:50:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6706531480909330426.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/CTLFireability18047692334503572036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6706531480909330426.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15543e+08,0.999432,30168,594,594,45380,3827,303,159248,178,37857,0
Converting to forward existential form...Done !
original formula: ((EF((A((((i0.i0.u3.p19==1)&&(i0.i0.i1.u6.p58==1))&&((i1.u13.p121==1)&&(i1.i1.u17.p143==1))) U (((i0.i1.u8.p70==1)&&(i0.i1.i1.u20.p83==1)...582
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U (!((E(!((((i0.i1.u8.p70==1)&&(i0.i1.i1.u20.p83==1))&&((i1.u13.p121==1)&&(i1.i1.u18.p14...1038
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u3.t109, i0.i0.u3.t110, i0.i0.u3.t111, i0.i0.u3.t112, i0.i0.u3.t113, i0.i0.i1.u5.t71, i...1428
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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
ITS-tools command line returned an error code 139
[2025-06-02 09:05:03] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:05:03] [INFO ] Input system was already deterministic with 224 transitions.
[2025-06-02 09:05:03] [INFO ] Transformed 119 places.
[2025-06-02 09:05:03] [INFO ] Transformed 224 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 09:05:03] [INFO ] Time to serialize gal into /tmp/CTLFireability183451666009179343.gal : 2 ms
[2025-06-02 09:05:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6776534538102747175.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/CTLFireability183451666009179343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6776534538102747175.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...327
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15543e+08,27.4836,584528,2,51550,5,2.05675e+06,6,0,700,2.41733e+06,0
Converting to forward existential form...Done !
original formula: ((EF((A((((p19==1)&&(p58==1))&&((p121==1)&&(p143==1))) U (((p70==1)&&(p83==1))&&((p121==1)&&(p145==1)))) + EX((p77==1)))) + A(EX(EF((((p1...346
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U (!((E(!((((p70==1)&&(p83==1))&&((p121==1)&&(p145==1)))) U (!((((p19==1)&&(p58==1))&&((...658
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t17, t18, t23, t24, t26, t27, t28, t30, t31, t34, t35, t36, t37, t38, t39,...555
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-09"
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-09, 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-174876524000162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-09.tgz
mv MedleyA-PT-09 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;