About the Execution of ITS-Tools for IBM319-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 468178.00 | 0.00 | 0.00 | FTTTFFTFFFTFTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500330.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 IBM319-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422500330
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 184K 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 IBM319-PT-none-CTLFireability-2023-12
FORMULA_NAME IBM319-PT-none-CTLFireability-2023-13
FORMULA_NAME IBM319-PT-none-CTLFireability-2023-14
FORMULA_NAME IBM319-PT-none-CTLFireability-2023-15
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-00
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-01
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-02
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-03
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-04
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-05
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-06
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-07
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-08
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-09
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-10
FORMULA_NAME IBM319-PT-none-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748835081378
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM319-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 03:31:22] [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 03:31:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:31:23] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2025-06-02 03:31:23] [INFO ] Transformed 253 places.
[2025-06-02 03:31:23] [INFO ] Transformed 178 transitions.
[2025-06-02 03:31:23] [INFO ] Found NUPN structural information;
[2025-06-02 03:31:23] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 149 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 32 places
Reduce places removed 40 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 212 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 211 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 211 transition count 177
Applied a total of 43 rules in 38 ms. Remains 211 /253 variables (removed 42) and now considering 177/178 (removed 1) transitions.
// Phase 1: matrix 177 rows 211 cols
[2025-06-02 03:31:23] [INFO ] Computed 47 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:23] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-06-02 03:31:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:31:23] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-02 03:31:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 177/387 variables, 210/257 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/388 variables, 1/258 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/258 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/388 variables, 0/258 constraints. Problems are: Problem set: 8 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 258 constraints, problems are : Problem set: 8 solved, 168 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 47/47 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 45/45 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/45 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 2/200 variables, 2/47 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/47 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 170/370 variables, 200/247 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 159/406 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/406 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 8/378 variables, 6/412 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 9/421 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/421 constraints. Problems are: Problem set: 8 solved, 168 unsolved
SMT process timed out in 60076ms, After SMT, problems are : Problem set: 8 solved, 168 unsolved
Search for dead transitions found 8 dead transitions in 60098ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 211/253 places, 169/178 transitions.
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60621 ms. Remains : 211/253 places, 169/178 transitions.
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Support contains 136 out of 205 places after structural reductions.
[2025-06-02 03:32:24] [INFO ] Flatten gal took : 67 ms
[2025-06-02 03:32:24] [INFO ] Flatten gal took : 16 ms
[2025-06-02 03:32:24] [INFO ] Input system was already deterministic with 169 transitions.
Support contains 126 out of 205 places (down from 136) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 85 to 84
RANDOM walk for 40000 steps (810 resets) in 2269 ms. (17 steps per ms) remains 7/84 properties
BEST_FIRST walk for 40002 steps (468 resets) in 592 ms. (67 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (462 resets) in 522 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (424 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (515 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (411 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (533 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (439 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
// Phase 1: matrix 169 rows 205 cols
[2025-06-02 03:32:25] [INFO ] Computed 47 invariants in 11 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/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 51/70 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 11/81 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 78/159 variables, 81/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 43/202 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 31/233 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 18/251 variables, 10/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 8/259 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/259 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/259 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 7/266 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/266 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/266 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 7/273 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/273 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/273 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 6/279 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/279 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/279 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 6/285 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/285 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 7/292 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/292 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/292 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 5/297 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/297 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (OVERLAPS) 7/304 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/304 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/304 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (OVERLAPS) 8/312 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/312 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/312 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (OVERLAPS) 6/318 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/318 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/318 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (OVERLAPS) 2/320 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/320 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (OVERLAPS) 3/323 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/323 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/323 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 50 (OVERLAPS) 3/326 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/326 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 3/329 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/329 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (OVERLAPS) 2/331 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/331 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (OVERLAPS) 3/334 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/334 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/334 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (OVERLAPS) 2/336 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/336 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (OVERLAPS) 3/339 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/339 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/339 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (OVERLAPS) 2/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/341 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 66 (OVERLAPS) 3/344 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/344 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/344 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (OVERLAPS) 2/346 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/346 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (OVERLAPS) 3/349 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/349 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (OVERLAPS) 5/354 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/354 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (OVERLAPS) 5/359 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/359 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (OVERLAPS) 4/363 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/363 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 79 (OVERLAPS) 7/370 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/370 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/370 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 82 (OVERLAPS) 4/374 variables, 3/252 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/374 variables, 0/252 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 0/374 variables, 0/252 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 252 constraints, problems are : Problem set: 5 solved, 2 unsolved in 1694 ms.
Refiners :[Generalized P Invariants (flows): 47/47 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 17/30 variables, 10/16 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 3/19 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 2/21 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 18/48 variables, 10/31 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 2/33 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 29/77 variables, 2/35 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/82 variables, 5/40 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/82 variables, 0/40 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 45/127 variables, 42/82 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/127 variables, 2/84 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/127 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 17/144 variables, 9/93 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/144 variables, 2/95 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/144 variables, 0/95 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 13/157 variables, 8/103 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/157 variables, 1/104 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 11/168 variables, 6/110 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/168 variables, 1/111 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 11/179 variables, 6/117 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/179 variables, 2/119 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/179 variables, 0/119 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 15/194 variables, 5/124 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/194 variables, 0/124 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 12/206 variables, 9/133 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/206 variables, 2/135 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/206 variables, 0/135 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 4/210 variables, 2/137 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/210 variables, 0/137 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 5/215 variables, 3/140 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/215 variables, 1/141 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/215 variables, 0/141 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 9/224 variables, 5/146 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/224 variables, 1/147 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/224 variables, 0/147 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 24/248 variables, 4/151 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/248 variables, 0/151 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 6/254 variables, 6/157 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/254 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 24/278 variables, 31/188 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/278 variables, 0/188 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 3/281 variables, 2/190 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/281 variables, 1/191 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/281 variables, 0/191 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 2/283 variables, 1/192 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/283 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 3/286 variables, 2/194 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/286 variables, 1/195 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/286 variables, 0/195 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 2/288 variables, 1/196 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/288 variables, 0/196 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 3/291 variables, 2/198 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/291 variables, 1/199 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/291 variables, 0/199 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 2/293 variables, 1/200 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/293 variables, 0/200 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 3/296 variables, 2/202 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/296 variables, 1/203 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/296 variables, 0/203 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 2/298 variables, 1/204 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/298 variables, 0/204 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 3/301 variables, 2/206 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/301 variables, 1/207 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/301 variables, 0/207 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 3/304 variables, 1/208 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/304 variables, 0/208 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 5/309 variables, 3/211 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/309 variables, 1/212 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/309 variables, 0/212 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 5/314 variables, 2/214 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/314 variables, 0/214 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 4/318 variables, 3/217 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/318 variables, 1/218 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/318 variables, 0/218 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 2/320 variables, 1/219 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/320 variables, 0/219 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 3/323 variables, 2/221 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/323 variables, 1/222 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/323 variables, 0/222 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 3/326 variables, 1/223 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/326 variables, 0/223 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 3/329 variables, 2/225 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/329 variables, 0/225 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 2/331 variables, 1/226 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/331 variables, 0/226 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 3/334 variables, 2/228 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/334 variables, 1/229 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/334 variables, 0/229 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 2/336 variables, 1/230 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/336 variables, 0/230 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 98 (OVERLAPS) 3/339 variables, 2/232 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/339 variables, 1/233 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/339 variables, 0/233 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 101 (OVERLAPS) 2/341 variables, 1/234 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 3/344 variables, 2/236 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/344 variables, 1/237 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/344 variables, 0/237 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 2/346 variables, 1/238 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/346 variables, 0/238 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 3/349 variables, 1/239 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/349 variables, 0/239 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 110 (OVERLAPS) 5/354 variables, 2/241 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/354 variables, 0/241 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 5/359 variables, 3/244 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/359 variables, 0/244 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 4/363 variables, 2/246 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/363 variables, 0/246 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 7/370 variables, 4/250 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/370 variables, 1/251 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/370 variables, 0/251 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Int declared 374/374 variables, and 254 constraints, problems are : Problem set: 7 solved, 0 unsolved in 1900 ms.
Refiners :[Generalized P Invariants (flows): 47/47 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3616ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA IBM319-PT-none-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:32:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 03:32:29] [INFO ] Flatten gal took : 10 ms
FORMULA IBM319-PT-none-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:32:29] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:32:29] [INFO ] Input system was already deterministic with 169 transitions.
Support contains 96 out of 205 places (down from 107) after GAL structural reductions.
Computed a total of 205 stabilizing places and 169 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 205 transition count 169
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 39 places
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 160 transition count 169
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 149 transition count 158
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 149 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 147 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 147 transition count 156
Applied a total of 71 rules in 20 ms. Remains 147 /205 variables (removed 58) and now considering 156/169 (removed 13) transitions.
// Phase 1: matrix 156 rows 147 cols
[2025-06-02 03:32:29] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:32:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-02 03:32:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:32:29] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2025-06-02 03:32:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 156/302 variables, 146/153 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 1/303 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 154 constraints, problems are : Problem set: 0 solved, 155 unsolved in 12977 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 156/302 variables, 146/153 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 155/308 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 1/303 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 309 constraints, problems are : Problem set: 0 solved, 155 unsolved in 28598 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41593ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 41597ms
Starting structural reductions in LTL mode, iteration 1 : 147/205 places, 156/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41805 ms. Remains : 147/205 places, 156/169 transitions.
[2025-06-02 03:33:11] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:33:11] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:33:11] [INFO ] Input system was already deterministic with 156 transitions.
[2025-06-02 03:33:11] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:33:11] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:33:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3271352047026105.gal : 4 ms
[2025-06-02 03:33:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3889954614000491760.ctl : 3 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/CTLFireability3271352047026105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3889954614000491760.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 -...280
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,2062,0.05514,4908,2,577,5,3700,6,0,740,3970,0
Converting to forward existential form...Done !
original formula: AF(((AX((callToTask_s00002950_inputCriterion_s00001053_used==1)) * E((!(EF(((callToProcess_s00002802_output_s00001054==1)&&(callToProcess...919
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((callToTask_s00002950_inputCriterion_s00001053_used==1)))) * E((!(E(TRUE U ((callToProcess...976
Reverse transition relation is NOT exact ! Due to transitions t32, t42, t43, t44, t45, t46, t140, t151, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,0.615383,28740,1,0,358,116145,344,197,4373,121667,533
FORMULA IBM319-PT-none-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 41 places
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 158 transition count 169
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 147 transition count 158
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 147 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 147 transition count 157
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 144 transition count 154
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 144 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 142 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 142 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 140 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 140 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 139 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 139 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 138 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 138 transition count 148
Applied a total of 88 rules in 21 ms. Remains 138 /205 variables (removed 67) and now considering 148/169 (removed 21) transitions.
// Phase 1: matrix 148 rows 138 cols
[2025-06-02 03:33:12] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:33:12] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 03:33:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:33:12] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-02 03:33: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/137 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/285 variables, 137/142 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/286 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 143 constraints, problems are : Problem set: 0 solved, 147 unsolved in 10482 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/285 variables, 137/142 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 147/289 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/286 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 290 constraints, problems are : Problem set: 0 solved, 147 unsolved in 23609 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34106ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 34108ms
Starting structural reductions in LTL mode, iteration 1 : 138/205 places, 148/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34294 ms. Remains : 138/205 places, 148/169 transitions.
[2025-06-02 03:33:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:33:46] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:33:46] [INFO ] Input system was already deterministic with 148 transitions.
[2025-06-02 03:33:46] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:33:46] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:33:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13161309440009598575.gal : 2 ms
[2025-06-02 03:33:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5087390141141152673.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/CTLFireability13161309440009598575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5087390141141152673.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,2173,0.036,4988,2,489,5,3125,6,0,696,2947,0
Converting to forward existential form...Done !
original formula: AF((E((((decision_s00003021_activated==1) + E(((join_s00001164_input_s00001127==1)&&(join_s00001164_input_s00001066==1)) U (callToProcess...572
=> equivalent forward existential formula: [FwdG(Init,!((E((((decision_s00003021_activated==1) + E(((join_s00001164_input_s00001127==1)&&(join_s00001164_in...635
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t132, t143, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,0.631649,28528,1,0,446,112550,342,284,3858,139056,588
FORMULA IBM319-PT-none-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 169/169 transitions.
Graph (complete) has 266 edges and 205 vertex of which 120 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 70 output transitions
Drop transitions (Output transitions of discarded places.) removed 70 transitions
Ensure Unique test removed 27 places
Reduce places removed 28 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 92 transition count 35
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 73 rules applied. Total rules applied 137 place count 29 transition count 25
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 143 place count 23 transition count 25
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 143 place count 23 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 161 place count 13 transition count 17
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 163 place count 12 transition count 16
Reduce places removed 1 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 4 with 3 rules applied. Total rules applied 166 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 10 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 167 place count 10 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 169 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 172 place count 9 transition count 10
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 6 with 1 rules applied. Total rules applied 173 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 175 place count 8 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 176 place count 7 transition count 8
Applied a total of 176 rules in 16 ms. Remains 7 /205 variables (removed 198) and now considering 8/169 (removed 161) transitions.
// Phase 1: matrix 8 rows 7 cols
[2025-06-02 03:33:47] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:33:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 03:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:33:47] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:33:47] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 03:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/15 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 136ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/205 places, 8/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 215 ms. Remains : 7/205 places, 8/169 transitions.
[2025-06-02 03:33:47] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:33:47] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:33:47] [INFO ] Input system was already deterministic with 8 transitions.
[2025-06-02 03:33:47] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:33:47] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:33:47] [INFO ] Time to serialize gal into /tmp/CTLFireability17017803913114446938.gal : 1 ms
[2025-06-02 03:33:47] [INFO ] Time to serialize properties into /tmp/CTLFireability814727385950098203.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/CTLFireability17017803913114446938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability814727385950098203.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,7,0.002799,3788,2,15,5,59,6,0,35,49,0
Converting to forward existential form...Done !
original formula: AF(AG(((EF(AG((fork_s00001071_activated_s00001073==1))) * (callToTask_s00002929_output_s00001054==1)) * (callToTask_s00002929_output_s000...167
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((E(TRUE U !(E(TRUE U !((fork_s00001071_activated_s00001073==1))))) * (callToTask_s000...242
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...169
(forward)formula 0,0,0.005754,3916,1,0,28,231,43,15,189,297,42
FORMULA IBM319-PT-none-CTLFireability-2025-03 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 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 43 places
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 156 transition count 169
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 144 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 144 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 144 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 141 transition count 153
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 141 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 139 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 139 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 137 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 137 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 136 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 136 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 135 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 135 transition count 147
Applied a total of 92 rules in 16 ms. Remains 135 /205 variables (removed 70) and now considering 147/169 (removed 22) transitions.
// Phase 1: matrix 147 rows 135 cols
[2025-06-02 03:33:47] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:33:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-02 03:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:33:47] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 138 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10846 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 284 constraints, problems are : Problem set: 0 solved, 146 unsolved in 23361 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34225ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 34226ms
Starting structural reductions in LTL mode, iteration 1 : 135/205 places, 147/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34408 ms. Remains : 135/205 places, 147/169 transitions.
[2025-06-02 03:34:21] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:34:21] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:34:21] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 03:34:21] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:34:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:34:21] [INFO ] Time to serialize gal into /tmp/CTLFireability8724614262421815387.gal : 1 ms
[2025-06-02 03:34:21] [INFO ] Time to serialize properties into /tmp/CTLFireability14218757535268223369.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/CTLFireability8724614262421815387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14218757535268223369.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,2038,0.033515,5064,2,614,5,3516,6,0,683,3149,0
Converting to forward existential form...Done !
original formula: (AX(AF(((callToTask_s00002957_input_s00001052==1)&&(callToTask_s00002957_input_s00001066==1)))) * AF(EG((fork_s00001298_activated_s000010...164
=> equivalent forward existential formula: ([FwdG(EY(Init),!(((callToTask_s00002957_input_s00001052==1)&&(callToTask_s00002957_input_s00001066==1))))] = FA...229
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
dead was empty
Hit Full ! (commute/partial/dont) 145/0/2
(forward)formula 0,0,0.690739,35492,1,0,410,171773,323,210,3763,160907,566
FORMULA IBM319-PT-none-CTLFireability-2025-04 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 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 41 places
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 158 transition count 169
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 146 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 146 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 146 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 143 transition count 153
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 143 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 141 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 141 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 139 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 139 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 138 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 138 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 137 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 137 transition count 147
Applied a total of 90 rules in 16 ms. Remains 137 /205 variables (removed 68) and now considering 147/169 (removed 22) transitions.
// Phase 1: matrix 147 rows 137 cols
[2025-06-02 03:34:22] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:34:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-02 03:34:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:34:22] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:34:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/283 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/284 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 142 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10647 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/283 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 146/287 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/284 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/284 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 288 constraints, problems are : Problem set: 0 solved, 146 unsolved in 21960 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32618ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 32619ms
Starting structural reductions in LTL mode, iteration 1 : 137/205 places, 147/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32817 ms. Remains : 137/205 places, 147/169 transitions.
[2025-06-02 03:34:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:34:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:34:55] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 03:34:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:34:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:34:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14107225750544388620.gal : 1 ms
[2025-06-02 03:34:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6460264399990673897.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/CTLFireability14107225750544388620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6460264399990673897.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,2038,0.033383,4844,2,510,5,2943,6,0,691,2363,0
Converting to forward existential form...Done !
original formula: A(AX(AF((fork_s00001403_activated_s00001073!=1))) U E((E(((decision_s00002761_activated!=1) * EF(((join_s00001163_input_s00001052==1)&&(j...551
=> equivalent forward existential formula: [((Init * !(EG(!(E((E(((decision_s00002761_activated!=1) * E(TRUE U ((join_s00001163_input_s00001052==1)&&(join_...1708
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,0.616208,28448,1,0,437,129340,336,276,3827,123886,660
FORMULA IBM319-PT-none-CTLFireability-2025-05 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 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 38 places
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 161 transition count 169
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 55 place count 150 transition count 158
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 150 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 150 transition count 157
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 147 transition count 154
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 147 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 145 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 145 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 143 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 142 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 141 transition count 148
Applied a total of 85 rules in 9 ms. Remains 141 /205 variables (removed 64) and now considering 148/169 (removed 21) transitions.
// Phase 1: matrix 148 rows 141 cols
[2025-06-02 03:34:55] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:34:55] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-02 03:34:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:34:56] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-02 03:34:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/148 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/289 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 149 constraints, problems are : Problem set: 0 solved, 147 unsolved in 10886 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/288 variables, 140/148 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 147/295 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/289 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 296 constraints, problems are : Problem set: 0 solved, 147 unsolved in 24569 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35483ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 35484ms
Starting structural reductions in LTL mode, iteration 1 : 141/205 places, 148/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35627 ms. Remains : 141/205 places, 148/169 transitions.
[2025-06-02 03:35:31] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:35:31] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:35:31] [INFO ] Input system was already deterministic with 148 transitions.
[2025-06-02 03:35:31] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:35:31] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:35:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13887038565099002035.gal : 1 ms
[2025-06-02 03:35:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15571671283877394466.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/CTLFireability13887038565099002035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15571671283877394466.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,2173,0.037504,4776,2,466,5,2645,6,0,708,2139,0
Converting to forward existential form...Done !
original formula: (EG((((callToTask_s00002896_output_s00001054==0)||(callToTask_s00002896_output_s00001077==0)) * ((((join_s00001163_input_s00001128==0)||(...835
=> equivalent forward existential formula: [(FwdU((Init * EG((((callToTask_s00002896_output_s00001054==0)||(callToTask_s00002896_output_s00001077==0)) * ((...899
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t132, t143, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,1.02453,41916,1,0,726,216371,339,499,3701,241468,1008
FORMULA IBM319-PT-none-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 38 places
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 161 transition count 169
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 152 transition count 160
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 152 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 152 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 150 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 150 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 149 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 149 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 148 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 148 transition count 155
Applied a total of 71 rules in 7 ms. Remains 148 /205 variables (removed 57) and now considering 155/169 (removed 14) transitions.
// Phase 1: matrix 155 rows 148 cols
[2025-06-02 03:35:32] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:35:32] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-02 03:35:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:35:32] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-06-02 03:35:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/302 variables, 147/155 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 1/303 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 156 constraints, problems are : Problem set: 0 solved, 154 unsolved in 12758 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/302 variables, 147/155 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 154/309 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 1/303 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 310 constraints, problems are : Problem set: 0 solved, 154 unsolved in 26663 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39431ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 39432ms
Starting structural reductions in LTL mode, iteration 1 : 148/205 places, 155/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39611 ms. Remains : 148/205 places, 155/169 transitions.
[2025-06-02 03:36:12] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:36:12] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:36:12] [INFO ] Input system was already deterministic with 155 transitions.
[2025-06-02 03:36:12] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:36:12] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:36:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6541264375221630042.gal : 1 ms
[2025-06-02 03:36:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7912699186273404897.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/CTLFireability6541264375221630042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7912699186273404897.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,2194,0.043399,4976,2,504,5,3145,6,0,742,3017,0
Converting to forward existential form...Done !
original formula: (A(((((!(AF(((callToTask_s00002896_output_s00001054==1)&&(callToTask_s00002896_output_s00001077==1)))) + AF(((merge_s00001160_input_s0000...855
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!(!((!(EX(!(EX(!((decision_s00001840_activated==1)))))) + EX(EX(((merge_s00001162_input_s00...1246
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t114, t139, t150, Intersection with reachable at each step ena...209
(forward)formula 0,0,0.990301,39436,1,0,562,208127,357,326,4394,200277,840
FORMULA IBM319-PT-none-CTLFireability-2025-07 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 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 42 places
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 157 transition count 169
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 145 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 145 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 145 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 142 transition count 153
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 142 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 140 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 140 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 138 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 138 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 137 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 137 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 136 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 136 transition count 147
Applied a total of 91 rules in 13 ms. Remains 136 /205 variables (removed 69) and now considering 147/169 (removed 22) transitions.
// Phase 1: matrix 147 rows 136 cols
[2025-06-02 03:36:13] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:36:13] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 03:36:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:36:13] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:36:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/282 variables, 135/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 140 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10827 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/282 variables, 135/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 146/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/283 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 286 constraints, problems are : Problem set: 0 solved, 146 unsolved in 21907 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32758ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 32760ms
Starting structural reductions in LTL mode, iteration 1 : 136/205 places, 147/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32956 ms. Remains : 136/205 places, 147/169 transitions.
[2025-06-02 03:36:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:36:46] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:36:46] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 03:36:46] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:36:46] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:36:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5604388556172436282.gal : 1 ms
[2025-06-02 03:36:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14541184595671229987.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/CTLFireability5604388556172436282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14541184595671229987.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,2038,0.035562,4828,2,436,5,2699,6,0,687,2312,0
Converting to forward existential form...Done !
original formula: EX((!(E(AX((fork_s00001403_activated_s00001075!=1)) U EG(AG(((callToTask_s00002959_output_s00001054==1)&&(callToTask_s00002959_output_s00...304
=> equivalent forward existential formula: [FwdG((EY(Init) * !(E(!(EX(!((fork_s00001403_activated_s00001075!=1)))) U EG(!(E(TRUE U !(((callToTask_s00002959...371
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,0.564785,27832,1,0,501,109008,331,341,3787,145353,641
FORMULA IBM319-PT-none-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 44 places
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 155 transition count 169
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 61 place count 144 transition count 158
Iterating global reduction 1 with 11 rules applied. Total rules applied 72 place count 144 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 144 transition count 157
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 141 transition count 154
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 141 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 139 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 139 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 137 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 137 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 136 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 136 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 135 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 135 transition count 148
Applied a total of 91 rules in 17 ms. Remains 135 /205 variables (removed 70) and now considering 148/169 (removed 21) transitions.
// Phase 1: matrix 148 rows 135 cols
[2025-06-02 03:36:46] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:36:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 03:36:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:36:47] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-02 03:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/282 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 137 constraints, problems are : Problem set: 0 solved, 147 unsolved in 10055 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/282 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 147/283 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/283 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 284 constraints, problems are : Problem set: 0 solved, 147 unsolved in 22397 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32461ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 32461ms
Starting structural reductions in LTL mode, iteration 1 : 135/205 places, 148/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32674 ms. Remains : 135/205 places, 148/169 transitions.
[2025-06-02 03:37:19] [INFO ] Flatten gal took : 12 ms
[2025-06-02 03:37:19] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:37:19] [INFO ] Input system was already deterministic with 148 transitions.
[2025-06-02 03:37:19] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:37:19] [INFO ] Flatten gal took : 23 ms
[2025-06-02 03:37:19] [INFO ] Time to serialize gal into /tmp/CTLFireability5076030242961658806.gal : 1 ms
[2025-06-02 03:37:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10899102678915476993.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/CTLFireability5076030242961658806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10899102678915476993.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,2080,0.065271,4816,2,507,5,3026,6,0,684,2683,0
Converting to forward existential form...Done !
original formula: AF(EX(A(EF(AG((callToTask_s00002960_inputCriterion_s00001053_used==1))) U A((decision_s00001123_activated==1) U EG((merge_s00002241_input...174
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((E(!(!((E(!(EG((merge_s00002241_input_s00001052==1))) U (!((decision_s00001123_activated==1)) ...751
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t132, t143, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,0.475051,22864,1,0,310,84990,327,149,3895,90415,455
FORMULA IBM319-PT-none-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 38 places
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 161 transition count 169
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 151 transition count 159
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 151 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 151 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 150 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 150 transition count 157
Applied a total of 67 rules in 5 ms. Remains 150 /205 variables (removed 55) and now considering 157/169 (removed 12) transitions.
// Phase 1: matrix 157 rows 150 cols
[2025-06-02 03:37:20] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:37:20] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-02 03:37:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:37:20] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2025-06-02 03:37:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/306 variables, 149/157 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 1/307 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/307 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 158 constraints, problems are : Problem set: 0 solved, 156 unsolved in 13108 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 157/306 variables, 149/157 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 156/313 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 1/307 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 314 constraints, problems are : Problem set: 0 solved, 156 unsolved in 27084 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40203ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 40203ms
Starting structural reductions in LTL mode, iteration 1 : 150/205 places, 157/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40354 ms. Remains : 150/205 places, 157/169 transitions.
[2025-06-02 03:38:00] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:38:00] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:38:00] [INFO ] Input system was already deterministic with 157 transitions.
[2025-06-02 03:38:00] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:38:00] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:38:00] [INFO ] Time to serialize gal into /tmp/CTLFireability13862710978157620673.gal : 1 ms
[2025-06-02 03:38:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14055238647327330553.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/CTLFireability13862710978157620673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14055238647327330553.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,2200,0.043476,5120,2,565,5,3551,6,0,752,3928,0
Converting to forward existential form...Done !
original formula: (A(EG((EX(AF((callToTask_s00002254_inputCriterion_s00001053_used==1))) + A(EG(((decision_s00001841_input_s00001052==1)&&(decision_s000018...910
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!(!(EG(!(!(((E(TRUE U (((callToTask_s00002950_output_s00001054==1)&&(callToTask_s00002950_out...2170
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t115, t141, t152, Intersection with reachable at each step ena...209
Hit Full ! (commute/partial/dont) 155/0/2
(forward)formula 0,0,0.54142,25192,1,0,316,92499,341,153,4172,107635,456
FORMULA IBM319-PT-none-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 43 places
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 156 transition count 169
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 144 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 144 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 144 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 142 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 142 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 141 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 141 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 140 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 140 transition count 152
Applied a total of 82 rules in 10 ms. Remains 140 /205 variables (removed 65) and now considering 152/169 (removed 17) transitions.
// Phase 1: matrix 152 rows 140 cols
[2025-06-02 03:38:00] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-02 03:38:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:01] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-02 03:38:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 152/291 variables, 139/142 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 1/292 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 143 constraints, problems are : Problem set: 0 solved, 151 unsolved in 11131 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 152/291 variables, 139/142 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 151/293 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 1/292 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 294 constraints, problems are : Problem set: 0 solved, 151 unsolved in 23794 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34938ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 34939ms
Starting structural reductions in LTL mode, iteration 1 : 140/205 places, 152/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35126 ms. Remains : 140/205 places, 152/169 transitions.
[2025-06-02 03:38:36] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:38:36] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:38:36] [INFO ] Input system was already deterministic with 152 transitions.
[2025-06-02 03:38:36] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:38:36] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:38:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15558087859246079819.gal : 1 ms
[2025-06-02 03:38:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4016900004955582534.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/CTLFireability15558087859246079819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4016900004955582534.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,2053,0.037307,4900,2,473,5,3150,6,0,708,3069,0
Converting to forward existential form...Done !
original formula: EG((EG(AX(((callToProcess_s00002943_output_s00001054==1)&&(callToProcess_s00002943_output_s00001077==1)))) + (callToProcess_s00002499_inp...187
=> equivalent forward existential formula: [FwdG(Init,(EG(!(EX(!(((callToProcess_s00002943_output_s00001054==1)&&(callToProcess_s00002943_output_s00001077=...236
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t136, t147, Intersection with reachable at each step enabled. ...203
(forward)formula 0,1,0.599182,30636,1,0,594,125861,330,358,3642,164259,657
FORMULA IBM319-PT-none-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 169/169 transitions.
Ensure Unique test removed 44 places
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 155 transition count 169
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 143 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 143 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 143 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 140 transition count 153
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 140 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 138 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 138 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 136 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 136 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 135 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 135 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 134 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 134 transition count 147
Applied a total of 93 rules in 13 ms. Remains 134 /205 variables (removed 71) and now considering 147/169 (removed 22) transitions.
// Phase 1: matrix 147 rows 134 cols
[2025-06-02 03:38:36] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:36] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-02 03:38:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:36] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:38:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10397 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 21029 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31452ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 31452ms
Starting structural reductions in LTL mode, iteration 1 : 134/205 places, 147/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31629 ms. Remains : 134/205 places, 147/169 transitions.
[2025-06-02 03:39:08] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:39:08] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:39:08] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 03:39:08] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:39:08] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:39:08] [INFO ] Time to serialize gal into /tmp/CTLFireability8891740522875542732.gal : 1 ms
[2025-06-02 03:39:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8619957628258824415.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/CTLFireability8891740522875542732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8619957628258824415.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,2038,0.035474,4792,2,444,5,2664,6,0,679,2255,0
Converting to forward existential form...Done !
original formula: EF((AX((decision_s00002948_activated==0)) * EG((fork_s00001298_activated_s00001075==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX(!((decision_s00002948_activated==0))))),(fork_s00001298_activated_s00001075==1))] ...163
Reverse transition relation is NOT exact ! Due to transitions t31, t41, t42, t43, t44, t45, t131, t142, Intersection with reachable at each step enabled. ...203
dead was empty
(forward)formula 0,0,0.332322,17848,1,0,301,55493,314,142,3484,65382,434
FORMULA IBM319-PT-none-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 169/169 transitions.
Graph (complete) has 266 edges and 205 vertex of which 163 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Ensure Unique test removed 36 places
Reduce places removed 37 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 126 transition count 47
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 99 rules applied. Total rules applied 189 place count 37 transition count 37
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 195 place count 31 transition count 37
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 195 place count 31 transition count 24
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 223 place count 16 transition count 24
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 225 place count 15 transition count 23
Reduce places removed 1 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 4 with 3 rules applied. Total rules applied 228 place count 14 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 229 place count 13 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 229 place count 13 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 12 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 236 place count 12 transition count 15
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 238 place count 12 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 240 place count 10 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 240 place count 10 transition count 11
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 244 place count 8 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 245 place count 8 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 245 place count 8 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 247 place count 7 transition count 9
Applied a total of 247 rules in 13 ms. Remains 7 /205 variables (removed 198) and now considering 9/169 (removed 160) transitions.
// Phase 1: matrix 9 rows 7 cols
[2025-06-02 03:39:08] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:08] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-02 03:39:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:39:08] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-02 03:39:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/14 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 7 unsolved in 68 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/14 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 73 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 145ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/205 places, 9/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 216 ms. Remains : 7/205 places, 9/169 transitions.
[2025-06-02 03:39:08] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:08] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:08] [INFO ] Input system was already deterministic with 9 transitions.
RANDOM walk for 116 steps (34 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
FORMULA IBM319-PT-none-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 03:39:08] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:08] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8217499083908029251.gal : 0 ms
[2025-06-02 03:39:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18147215905081052054.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8217499083908029251.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18147215905081052054.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 169/169 transitions.
Graph (complete) has 266 edges and 205 vertex of which 172 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Ensure Unique test removed 36 places
Reduce places removed 37 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 135 transition count 62
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 91 rules applied. Total rules applied 178 place count 50 transition count 56
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 9 rules applied. Total rules applied 187 place count 46 transition count 51
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 193 place count 41 transition count 50
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 193 place count 41 transition count 36
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 4 with 30 rules applied. Total rules applied 223 place count 25 transition count 36
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 225 place count 24 transition count 35
Reduce places removed 1 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 5 with 3 rules applied. Total rules applied 228 place count 23 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 229 place count 22 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 229 place count 22 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 231 place count 21 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 237 place count 21 transition count 26
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 7 with 1 rules applied. Total rules applied 238 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 240 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 241 place count 19 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 241 place count 19 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 247 place count 16 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 248 place count 16 transition count 20
Applied a total of 248 rules in 10 ms. Remains 16 /205 variables (removed 189) and now considering 20/169 (removed 149) transitions.
// Phase 1: matrix 20 rows 16 cols
[2025-06-02 03:39:09] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:09] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 03:39:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:09] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:39:09] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-02 03:39:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 19/34 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 17 constraints, problems are : Problem set: 0 solved, 18 unsolved in 198 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 19/34 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/36 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 199 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 402ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/205 places, 20/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 468 ms. Remains : 16/205 places, 20/169 transitions.
[2025-06-02 03:39:09] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:09] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:39:09] [INFO ] Input system was already deterministic with 20 transitions.
[2025-06-02 03:39:09] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:39:09] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:39:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11790888421653315195.gal : 0 ms
[2025-06-02 03:39:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13352189288323492318.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/CTLFireability11790888421653315195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13352189288323492318.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,20,0.003251,3784,2,35,5,170,6,0,81,126,0
Converting to forward existential form...Done !
original formula: AG((AF(((AG((callToProcess_s00002499_inputCriterion_s00001053_used==1)) + (callToTask_s00002896_output_s00001054==0)) + (callToTask_s0000...285
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(E((decision_s00001840_activated==1) U (callToTask_s00002966_inputCriterion_s000010...352
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t12, t15, t17, t19, Intersection with reachable at each step enabled. (destroyed/rev...187
dead was empty
(forward)formula 0,1,0.008488,4552,1,0,58,924,74,27,447,1094,77
FORMULA IBM319-PT-none-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-02 03:39:09] [INFO ] Flatten gal took : 10 ms
[2025-06-02 03:39:09] [INFO ] Flatten gal took : 5 ms
Total runtime 466603 ms.
BK_STOP 1748835549556
--------------------
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="IBM319-PT-none"
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 IBM319-PT-none, 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 r114-tall-174876422500330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBM319-PT-none.tgz
mv IBM319-PT-none 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 ;