Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500346.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 IBM703-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-174876422500346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 5.7K 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.1K 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 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K 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 203K 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 IBM703-PT-none-CTLFireability-2023-12
FORMULA_NAME IBM703-PT-none-CTLFireability-2023-13
FORMULA_NAME IBM703-PT-none-CTLFireability-2023-14
FORMULA_NAME IBM703-PT-none-CTLFireability-2023-15
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-00
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-01
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-02
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-03
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-04
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-05
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-06
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-07
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-08
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-09
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-10
FORMULA_NAME IBM703-PT-none-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748835642359

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 03:40:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 03:40:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:40:43] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2025-06-02 03:40:43] [INFO ] Transformed 262 places.
[2025-06-02 03:40:43] [INFO ] Transformed 284 transitions.
[2025-06-02 03:40:43] [INFO ] Found NUPN structural information;
[2025-06-02 03:40:43] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 99 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 284
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 19 place count 243 transition count 271
Iterating global reduction 1 with 13 rules applied. Total rules applied 32 place count 243 transition count 271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 242 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 242 transition count 270
Applied a total of 34 rules in 65 ms. Remains 242 /262 variables (removed 20) and now considering 270/284 (removed 14) transitions.
// Phase 1: matrix 270 rows 242 cols
[2025-06-02 03:40:44] [INFO ] Computed 0 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:44] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-06-02 03:40:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:44] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-02 03:40:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 270/511 variables, 241/241 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 1/512 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 0/512 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 242 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30014 ms.
Refiners :[State Equation: 242/242 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 270/511 variables, 241/241 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 269/510 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 511 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30025 ms.
Refiners :[State Equation: 242/242 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 242/262 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60639 ms. Remains : 242/262 places, 270/284 transitions.
Support contains 99 out of 242 places after structural reductions.
[2025-06-02 03:41:44] [INFO ] Flatten gal took : 37 ms
[2025-06-02 03:41:44] [INFO ] Flatten gal took : 16 ms
[2025-06-02 03:41:45] [INFO ] Input system was already deterministic with 270 transitions.
RANDOM walk for 40000 steps (693 resets) in 1288 ms. (31 steps per ms) remains 7/87 properties
BEST_FIRST walk for 40000 steps (485 resets) in 368 ms. (108 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (440 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (460 resets) in 233 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (424 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (475 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (451 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (456 resets) in 216 ms. (184 steps per ms) remains 7/7 properties
[2025-06-02 03:41:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 32/48 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 74/186 variables, 33/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 75/261 variables, 36/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 61/322 variables, 31/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 42/364 variables, 21/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 33/397 variables, 17/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 28/425 variables, 13/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 25/450 variables, 13/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 17/467 variables, 9/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/467 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 21 (OVERLAPS) 11/478 variables, 6/225 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/478 variables, 0/225 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 9/487 variables, 4/229 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/487 variables, 0/229 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 12/499 variables, 5/234 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/499 variables, 0/234 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 9/508 variables, 5/239 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/508 variables, 0/239 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/512 variables, 3/242 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/512 variables, 0/242 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/512 variables, 0/242 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 242 constraints, problems are : Problem set: 6 solved, 1 unsolved in 848 ms.
Refiners :[State Equation: 242/242 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/18 variables, 5/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 1/8 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/31 variables, 6/14 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/44 variables, 6/20 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/20 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/54 variables, 5/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/65 variables, 5/30 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/65 variables, 0/30 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/84 variables, 6/36 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 0/36 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 26/110 variables, 12/48 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/110 variables, 0/48 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 28/138 variables, 13/61 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/138 variables, 0/61 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 28/166 variables, 13/74 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/166 variables, 0/74 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 26/192 variables, 13/87 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/87 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 20/212 variables, 11/98 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/212 variables, 0/98 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 18/230 variables, 8/106 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/230 variables, 0/106 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 24/254 variables, 10/116 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/254 variables, 0/116 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 28/282 variables, 13/129 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/282 variables, 0/129 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 25/307 variables, 13/142 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/307 variables, 0/142 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 30/337 variables, 13/155 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/337 variables, 0/155 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 29/366 variables, 16/171 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/366 variables, 0/171 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 25/391 variables, 10/181 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/391 variables, 0/181 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 25/416 variables, 12/193 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/416 variables, 0/193 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 24/440 variables, 12/205 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/440 variables, 0/205 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 23/463 variables, 12/217 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/463 variables, 0/217 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 13/476 variables, 8/225 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/476 variables, 0/225 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 9/485 variables, 4/229 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/485 variables, 0/229 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 10/495 variables, 5/234 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/495 variables, 0/234 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 8/503 variables, 4/238 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/503 variables, 0/238 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 6/509 variables, 3/241 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/509 variables, 0/241 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp58 is UNSAT
After SMT solving in domain Int declared 512/512 variables, and 243 constraints, problems are : Problem set: 7 solved, 0 unsolved in 434 ms.
Refiners :[State Equation: 242/242 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1306ms 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.
[2025-06-02 03:41:47] [INFO ] Flatten gal took : 24 ms
[2025-06-02 03:41:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA IBM703-PT-none-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:41:47] [INFO ] Flatten gal took : 12 ms
[2025-06-02 03:41:47] [INFO ] Input system was already deterministic with 270 transitions.
Computed a total of 242 stabilizing places and 270 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 242 transition count 270
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Graph (complete) has 270 edges and 242 vertex of which 157 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.2 ms
Discarding 85 places :
Also discarding 90 output transitions
Drop transitions (Output transitions of discarded places.) removed 90 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 156 transition count 78
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 116 rules applied. Total rules applied 218 place count 55 transition count 63
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 231 place count 45 transition count 60
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 234 place count 42 transition count 60
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 234 place count 42 transition count 53
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 248 place count 35 transition count 53
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 249 place count 34 transition count 52
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 34 transition count 52
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 251 place count 33 transition count 50
Iterating global reduction 4 with 1 rules applied. Total rules applied 252 place count 33 transition count 50
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 260 place count 29 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 29 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 28 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 28 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 268 place count 28 transition count 39
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 3 rules applied. Total rules applied 271 place count 28 transition count 36
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 274 place count 25 transition count 36
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 276 place count 25 transition count 36
Applied a total of 276 rules in 39 ms. Remains 25 /242 variables (removed 217) and now considering 36/270 (removed 234) transitions.
// Phase 1: matrix 36 rows 25 cols
[2025-06-02 03:41:47] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:41:47] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-02 03:41:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:41:47] [INFO ] Implicit Places using invariants and state equation in 29 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:41:47] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2025-06-02 03:41: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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 35/59 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 2/61 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 0/61 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 25 constraints, problems are : Problem set: 0 solved, 32 unsolved in 541 ms.
Refiners :[State Equation: 25/25 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 35/59 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 32/56 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 2/61 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 57 constraints, problems are : Problem set: 0 solved, 32 unsolved in 507 ms.
Refiners :[State Equation: 25/25 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1064ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1064ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/242 places, 36/270 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1156 ms. Remains : 25/242 places, 36/270 transitions.
[2025-06-02 03:41:48] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:41:48] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:41:48] [INFO ] Input system was already deterministic with 36 transitions.
[2025-06-02 03:41:48] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:41:48] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:41:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13835279840785424815.gal : 1 ms
[2025-06-02 03:41:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10725001293152281519.ctl : 6 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/CTLFireability13835279840785424815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10725001293152281519.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,38,0.014136,3924,2,58,5,341,6,0,131,336,0


Converting to forward existential form...Done !
original formula: AF(AG((((A(AG((task_s00000724_output_s00000264==1)) U (task_s00000758_inputCriterion_s00000257_used!=1)) + (merge_s00000453_input_s000002...424
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((!((E(!((task_s00000758_inputCriterion_s00000257_used!=1)) U (!(!(E(TRUE U !((task_s...620
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t9, t10, t12, t16, t21, t22, t29, t31, t34, Intersection with reachable at each step...212
dead was empty
(forward)formula 0,1,0.027087,4820,1,0,91,3708,104,52,727,3775,122
FORMULA IBM703-PT-none-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 224 transition count 252
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 224 transition count 252
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 216 transition count 244
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 216 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 216 transition count 243
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 211 transition count 238
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 211 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 211 transition count 237
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 209 transition count 235
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 209 transition count 235
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 207 transition count 233
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 207 transition count 233
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 205 transition count 231
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 205 transition count 231
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 203 transition count 229
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 203 transition count 229
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 201 transition count 227
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 201 transition count 227
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 199 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 199 transition count 225
Applied a total of 88 rules in 37 ms. Remains 199 /242 variables (removed 43) and now considering 225/270 (removed 45) transitions.
// Phase 1: matrix 225 rows 199 cols
[2025-06-02 03:41:48] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:41:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-02 03:41:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:41:49] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-06-02 03:41:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 225/423 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 1/424 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 0/424 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 199 constraints, problems are : Problem set: 0 solved, 224 unsolved in 26084 ms.
Refiners :[State Equation: 199/199 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 225/423 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 224/422 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 1/424 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 423 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30015 ms.
Refiners :[State Equation: 199/199 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56116ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 56117ms
Starting structural reductions in LTL mode, iteration 1 : 199/242 places, 225/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56350 ms. Remains : 199/242 places, 225/270 transitions.
[2025-06-02 03:42:45] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:42:45] [INFO ] Flatten gal took : 7 ms
[2025-06-02 03:42:45] [INFO ] Input system was already deterministic with 225 transitions.
[2025-06-02 03:42:45] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:42:45] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:42:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9572089615134393843.gal : 3 ms
[2025-06-02 03:42:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5424014202522392334.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/CTLFireability9572089615134393843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5424014202522392334.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,4830,0.076839,6516,2,781,5,7508,6,0,1020,10730,0


Converting to forward existential form...Done !
original formula: E(AF((((task_s00000760_input_s00000263==1)||(task_s00000733_inputCriterion_s00000257_used==1)) + ((EG((task_s00000739_inputCriterion_s000...951
=> equivalent forward existential formula: [(((FwdU(Init,!(EG(!((((task_s00000760_input_s00000263==1)||(task_s00000733_inputCriterion_s00000257_used==1)) +...2373
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t29, t34, t36, t41, t46, t48, t57, t58, t64, t72, t129, t131, t160, t180, t181, t20...276
(forward)formula 0,0,4.6321,173272,1,0,1616,1.17614e+06,518,986,5613,1.00856e+06,1944
FORMULA IBM703-PT-none-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 220 transition count 248
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 220 transition count 248
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 58 place count 206 transition count 234
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 206 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 206 transition count 233
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 81 place count 198 transition count 225
Iterating global reduction 1 with 8 rules applied. Total rules applied 89 place count 198 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 198 transition count 223
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 193 transition count 218
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 193 transition count 218
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 106 place count 188 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 111 place count 188 transition count 213
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 183 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 183 transition count 208
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 179 transition count 204
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 179 transition count 204
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 133 place count 175 transition count 200
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 175 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 172 transition count 197
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 171 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 170 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 169 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 169 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 169 transition count 193
Applied a total of 150 rules in 50 ms. Remains 169 /242 variables (removed 73) and now considering 193/270 (removed 77) transitions.
// Phase 1: matrix 193 rows 169 cols
[2025-06-02 03:42:49] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:42:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 03:42:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:42:50] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-02 03:42:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 193/361 variables, 168/168 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 1/362 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 0/362 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 169 constraints, problems are : Problem set: 0 solved, 192 unsolved in 25189 ms.
Refiners :[State Equation: 169/169 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 193/361 variables, 168/168 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 192/360 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 1/362 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 361 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30017 ms.
Refiners :[State Equation: 169/169 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55219ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 55219ms
Starting structural reductions in LTL mode, iteration 1 : 169/242 places, 193/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55428 ms. Remains : 169/242 places, 193/270 transitions.
[2025-06-02 03:43:45] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:43:45] [INFO ] Flatten gal took : 10 ms
[2025-06-02 03:43:45] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-02 03:43:45] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:43:45] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:43:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17751061722845492512.gal : 2 ms
[2025-06-02 03:43:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9374366232032212681.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/CTLFireability17751061722845492512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9374366232032212681.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,2329,0.057373,5892,2,646,5,5558,6,0,869,7790,0


Converting to forward existential form...Done !
original formula: !(A(AF(((task_s00000753_output_s00000264!=1) * (EX((decision_s00000777_activated==1)) + EF((decision_s00000805_activated==1))))) U (merge...181
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!((merge_s00000319_activated==1))) * !((merge_s00000319_activated==1))),!(((task_s00000753_out...332
Hit Full ! (commute/partial/dont) 191/0/2
Reverse transition relation is NOT exact ! Due to transitions t25, t26, t27, t28, t31, t32, t33, t38, t39, t43, t45, t50, t53, t54, t59, t67, t75, t84, t12...282
(forward)formula 0,1,0.687346,32012,1,0,411,111162,422,229,5081,148788,557
FORMULA IBM703-PT-none-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 221 transition count 249
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 221 transition count 249
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 54 place count 209 transition count 237
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 209 transition count 237
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 201 transition count 229
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 201 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 201 transition count 227
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 197 transition count 223
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 197 transition count 223
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 193 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 193 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 190 transition count 216
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 190 transition count 216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 187 transition count 213
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 187 transition count 213
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 184 transition count 210
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 184 transition count 210
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 182 transition count 208
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 182 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 181 transition count 207
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 181 transition count 207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 180 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 180 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 179 transition count 205
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 179 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 129 place count 179 transition count 204
Applied a total of 129 rules in 40 ms. Remains 179 /242 variables (removed 63) and now considering 204/270 (removed 66) transitions.
// Phase 1: matrix 204 rows 179 cols
[2025-06-02 03:43:46] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-02 03:43:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:46] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-06-02 03:43:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 204/382 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 1/383 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 0/383 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 179 constraints, problems are : Problem set: 0 solved, 203 unsolved in 25433 ms.
Refiners :[State Equation: 179/179 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 204/382 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 203/381 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 1/383 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 382 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30019 ms.
Refiners :[State Equation: 179/179 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55460ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 55461ms
Starting structural reductions in LTL mode, iteration 1 : 179/242 places, 204/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55599 ms. Remains : 179/242 places, 204/270 transitions.
[2025-06-02 03:44:41] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:44:41] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:44:41] [INFO ] Input system was already deterministic with 204 transitions.
[2025-06-02 03:44:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:44:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:44:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8873762173253402635.gal : 2 ms
[2025-06-02 03:44:41] [INFO ] Time to serialize properties into /tmp/CTLFireability1549401981421096583.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/CTLFireability8873762173253402635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1549401981421096583.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,2378,0.056792,5804,2,651,5,5475,6,0,920,6797,0


Converting to forward existential form...Done !
original formula: EG(((EX((task_s00000729_input_s00000263==1)) + (EF(((EG((task_s00000711_input_s00000263==1)) + (decision_s00000780_activated==1)) + (merg...569
=> equivalent forward existential formula: [FwdG(Init,((EX((task_s00000729_input_s00000263==1)) + (E(TRUE U ((EG((task_s00000711_input_s00000263==1)) + (de...763
Reverse transition relation is NOT exact ! Due to transitions t24, t27, t33, t34, t35, t40, t41, t45, t47, t52, t55, t56, t77, t82, t126, t168, t177, t191,...262
(forward)formula 0,1,1.40139,62932,1,0,673,359627,456,382,5401,318969,908
FORMULA IBM703-PT-none-CTLFireability-2025-03 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 : 242/242 places, 270/270 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 219 transition count 247
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 219 transition count 247
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 61 place count 204 transition count 232
Iterating global reduction 0 with 15 rules applied. Total rules applied 76 place count 204 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 204 transition count 231
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 196 transition count 223
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 196 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 196 transition count 221
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 193 transition count 218
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 193 transition count 218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 190 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 190 transition count 215
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 187 transition count 212
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 187 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 185 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 185 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 183 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 183 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 181 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 181 transition count 206
Applied a total of 125 rules in 62 ms. Remains 181 /242 variables (removed 61) and now considering 206/270 (removed 64) transitions.
// Phase 1: matrix 206 rows 181 cols
[2025-06-02 03:44:43] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:44:43] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-02 03:44:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:44:43] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2025-06-02 03:44:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 206/386 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/387 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 0/387 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 181 constraints, problems are : Problem set: 0 solved, 205 unsolved in 21740 ms.
Refiners :[State Equation: 181/181 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 206/386 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 205/385 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 1/387 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 386 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30015 ms.
Refiners :[State Equation: 181/181 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51782ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 51782ms
Starting structural reductions in LTL mode, iteration 1 : 181/242 places, 206/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52076 ms. Remains : 181/242 places, 206/270 transitions.
[2025-06-02 03:45:35] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:45:35] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:45:35] [INFO ] Input system was already deterministic with 206 transitions.
[2025-06-02 03:45:35] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:45:35] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:45:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11580180313049201443.gal : 1 ms
[2025-06-02 03:45:35] [INFO ] Time to serialize properties into /tmp/CTLFireability5829628752656493796.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/CTLFireability11580180313049201443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5829628752656493796.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,3370,0.064158,6224,2,737,5,6645,6,0,930,9840,0


Converting to forward existential form...Done !
original formula: E(EF(!((EX(EX((task_s00000730_output_s00000264==1))) + !((EX((task_s00000756_output_s00000264==1)) + (merge_s00000461_activated!=1)))))) ...297
=> equivalent forward existential formula: [FwdG((FwdU(Init,E(TRUE U !((EX(EX((task_s00000730_output_s00000264==1))) + !((EX((task_s00000756_output_s000002...359
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t25, t27, t28, t29, t30, t33, t35, t40, t45, t47, t55, t56, t70, t123, t124, t145, t...278
(forward)formula 0,1,0.794264,38852,1,0,394,148986,445,229,5445,176774,580
FORMULA IBM703-PT-none-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 220 transition count 248
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 220 transition count 248
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 59 place count 205 transition count 233
Iterating global reduction 0 with 15 rules applied. Total rules applied 74 place count 205 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 205 transition count 232
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 197 transition count 224
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 197 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 197 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 193 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 193 transition count 218
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 189 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 189 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 185 transition count 210
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 185 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 183 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 183 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 181 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 181 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 179 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 179 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 178 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 178 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 177 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 177 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 176 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 176 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 176 transition count 200
Applied a total of 136 rules in 43 ms. Remains 176 /242 variables (removed 66) and now considering 200/270 (removed 70) transitions.
// Phase 1: matrix 200 rows 176 cols
[2025-06-02 03:45:36] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:45:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-02 03:45:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:45:36] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-06-02 03:45: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/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 200/375 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 1/376 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 0/376 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 176 constraints, problems are : Problem set: 0 solved, 199 unsolved in 22241 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 200/375 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 199/374 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 1/376 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 375 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30018 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52269ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 52269ms
Starting structural reductions in LTL mode, iteration 1 : 176/242 places, 200/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52461 ms. Remains : 176/242 places, 200/270 transitions.
[2025-06-02 03:46:28] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:46:28] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:46:28] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-02 03:46:28] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:46:28] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:46:28] [INFO ] Time to serialize gal into /tmp/CTLFireability18031505669667953966.gal : 1 ms
[2025-06-02 03:46:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7822006359855607865.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/CTLFireability18031505669667953966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7822006359855607865.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,2402,0.062227,6120,2,699,5,6122,6,0,904,9129,0


Converting to forward existential form...Done !
original formula: EX((!(A(AF((task_s00000756_output_s00000264==1)) U EG((decision_s00000778_activated!=1)))) + AG(((callToProcess_s00000348_inputCriterion_...255
=> equivalent forward existential formula: (([((FwdU(EY(Init),!(EG((decision_s00000778_activated!=1)))) * !(!(EG(!((task_s00000756_output_s00000264==1)))))...462
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t26, t27, t28, t32, t34, t40, t44, t46, t51, t54, t55, t60, t68, t76, t85, t12...282
dead was empty
(forward)formula 0,0,1.69263,74368,1,0,864,445237,437,471,4969,393807,1098
FORMULA IBM703-PT-none-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 221 transition count 249
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 221 transition count 249
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 208 transition count 236
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 208 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 208 transition count 235
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 77 place count 200 transition count 227
Iterating global reduction 1 with 8 rules applied. Total rules applied 85 place count 200 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 200 transition count 225
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 91 place count 196 transition count 221
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 196 transition count 221
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 99 place count 192 transition count 217
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 192 transition count 217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 189 transition count 214
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 189 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 187 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 187 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 185 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 185 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 183 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 183 transition count 208
Applied a total of 121 rules in 15 ms. Remains 183 /242 variables (removed 59) and now considering 208/270 (removed 62) transitions.
// Phase 1: matrix 208 rows 183 cols
[2025-06-02 03:46:30] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:30] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 03:46:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:30] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2025-06-02 03:46:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 208/390 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 1/391 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 0/391 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 183 constraints, problems are : Problem set: 0 solved, 207 unsolved in 26562 ms.
Refiners :[State Equation: 183/183 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 208/390 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 207/389 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 1/391 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 390 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30017 ms.
Refiners :[State Equation: 183/183 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56590ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 56591ms
Starting structural reductions in LTL mode, iteration 1 : 183/242 places, 208/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56773 ms. Remains : 183/242 places, 208/270 transitions.
[2025-06-02 03:47:27] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:47:27] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:47:27] [INFO ] Input system was already deterministic with 208 transitions.
[2025-06-02 03:47:27] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:47:27] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:47:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14190195199271180487.gal : 1 ms
[2025-06-02 03:47:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10621512805716188547.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/CTLFireability14190195199271180487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10621512805716188547.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,3608,0.066427,6236,2,749,5,6717,6,0,939,9299,0


Converting to forward existential form...Done !
original formula: AG(AF((EX((merge_s00000455_activated==0)) + (EX((task_s00000748_output_s00000264==0)) * ((task_s00000739_output_s00000264==1)||(task_s000...199
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EX((merge_s00000455_activated==0)) + (EX((task_s00000748_output_s00000264==0)) * ((task...251
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t28, t29, t30, t33, t35, t40, t45, t47, t55, t56, t62, t70, t87, t124, t144, t169, ...273
(forward)formula 0,0,0.665695,32152,1,0,364,108314,439,201,4813,134967,541
FORMULA IBM703-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 : 242/242 places, 270/270 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 220 transition count 248
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 220 transition count 248
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 209 transition count 237
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 209 transition count 237
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 201 transition count 229
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 201 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 201 transition count 227
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 196 transition count 222
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 196 transition count 222
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 192 transition count 218
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 192 transition count 218
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 106 place count 188 transition count 214
Iterating global reduction 1 with 4 rules applied. Total rules applied 110 place count 188 transition count 214
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 114 place count 184 transition count 210
Iterating global reduction 1 with 4 rules applied. Total rules applied 118 place count 184 transition count 210
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 180 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 180 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 177 transition count 203
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 177 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 176 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 176 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 175 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 175 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 174 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 174 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 139 place count 174 transition count 199
Applied a total of 139 rules in 17 ms. Remains 174 /242 variables (removed 68) and now considering 199/270 (removed 71) transitions.
// Phase 1: matrix 199 rows 174 cols
[2025-06-02 03:47:27] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:47:27] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 03:47:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:47:27] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-02 03:47:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/372 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 174 constraints, problems are : Problem set: 0 solved, 198 unsolved in 25733 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/372 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 198/371 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/373 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 372 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30013 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55767ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 55767ms
Starting structural reductions in LTL mode, iteration 1 : 174/242 places, 199/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55924 ms. Remains : 174/242 places, 199/270 transitions.
[2025-06-02 03:48:23] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:48:23] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:48:23] [INFO ] Input system was already deterministic with 199 transitions.
[2025-06-02 03:48:23] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:48:23] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:48:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16084865590983137757.gal : 1 ms
[2025-06-02 03:48:23] [INFO ] Time to serialize properties into /tmp/CTLFireability7559135536673682669.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/CTLFireability16084865590983137757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7559135536673682669.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,2382,0.057941,5968,2,652,5,6032,6,0,895,7959,0


Converting to forward existential form...Done !
original formula: (EG(((EF((task_s00000761_inputCriterion_s00000257_used==1)) * AG((task_s00000739_inputCriterion_s00000257_used==1))) * !(A(E((callToProce...389
=> equivalent forward existential formula: ([FwdG(Init,((E(TRUE U (task_s00000761_inputCriterion_s00000257_used==1)) * !(E(TRUE U !((task_s00000739_inputCr...709
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t27, t29, t32, t33, t34, t39, t40, t44, t46, t54, t55, t60, t68, t76, t77, t163, t1...283
dead was empty
(forward)formula 0,0,2.15174,78076,1,0,1019,494944,446,633,4910,410256,1419
FORMULA IBM703-PT-none-CTLFireability-2025-08 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 : 242/242 places, 270/270 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 221 transition count 249
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 221 transition count 249
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 54 place count 209 transition count 237
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 209 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 209 transition count 236
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 201 transition count 228
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 201 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 201 transition count 226
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 197 transition count 222
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 197 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 193 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 193 transition count 218
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 189 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 189 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 186 transition count 211
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 186 transition count 211
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 183 transition count 208
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 183 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 181 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 181 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 180 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 180 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 179 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 179 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 178 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 178 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 178 transition count 202
Applied a total of 132 rules in 21 ms. Remains 178 /242 variables (removed 64) and now considering 202/270 (removed 68) transitions.
// Phase 1: matrix 202 rows 178 cols
[2025-06-02 03:48:25] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:25] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-02 03:48:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:25] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-02 03:48:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 202/379 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/380 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 0/380 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 178 constraints, problems are : Problem set: 0 solved, 201 unsolved in 25629 ms.
Refiners :[State Equation: 178/178 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 202/379 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 201/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 1/380 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 379 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30018 ms.
Refiners :[State Equation: 178/178 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55657ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 55658ms
Starting structural reductions in LTL mode, iteration 1 : 178/242 places, 202/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55796 ms. Remains : 178/242 places, 202/270 transitions.
[2025-06-02 03:49:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:49:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:49:21] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-02 03:49:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:49:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:49:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10806276816905426255.gal : 2 ms
[2025-06-02 03:49:21] [INFO ] Time to serialize properties into /tmp/CTLFireability3697799911405118628.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/CTLFireability10806276816905426255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3697799911405118628.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,2622,0.070566,6328,2,743,5,7173,6,0,914,9764,0


Converting to forward existential form...Done !
original formula: E(!(((AF(!(EF((task_s00000759_inputCriterion_s00000257_used==1)))) * E(((task_s00000720_inputCriterion_s00000257_used==1)||(decision_s000...412
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,!(((!(EG(!(!(E(TRUE U (task_s00000759_inputCriterion_s00000257_used==1)))))) * E(((task_s00...475
Reverse transition relation is NOT exact ! Due to transitions t9, t25, t27, t28, t29, t30, t34, t35, t36, t41, t42, t46, t48, t53, t56, t57, t62, t70, t78,...284
dead was empty
(forward)formula 0,0,0.724637,33644,1,0,358,117200,434,194,5025,147254,529
FORMULA IBM703-PT-none-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 219 transition count 247
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 219 transition count 247
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 61 place count 204 transition count 232
Iterating global reduction 0 with 15 rules applied. Total rules applied 76 place count 204 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 204 transition count 231
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 195 transition count 222
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 195 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 195 transition count 220
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 190 transition count 215
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 190 transition count 215
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 186 transition count 211
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 186 transition count 211
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 119 place count 182 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 123 place count 182 transition count 207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 127 place count 178 transition count 203
Iterating global reduction 2 with 4 rules applied. Total rules applied 131 place count 178 transition count 203
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 135 place count 174 transition count 199
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 174 transition count 199
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 171 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 170 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 169 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 168 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 168 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 168 transition count 192
Applied a total of 152 rules in 22 ms. Remains 168 /242 variables (removed 74) and now considering 192/270 (removed 78) transitions.
// Phase 1: matrix 192 rows 168 cols
[2025-06-02 03:49:22] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:22] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-02 03:49:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:49:22] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2025-06-02 03:49: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/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 192/359 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 1/360 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 0/360 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 168 constraints, problems are : Problem set: 0 solved, 191 unsolved in 24715 ms.
Refiners :[State Equation: 168/168 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 192/359 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 191/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 1/360 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 359 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30010 ms.
Refiners :[State Equation: 168/168 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54735ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 54735ms
Starting structural reductions in LTL mode, iteration 1 : 168/242 places, 192/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54884 ms. Remains : 168/242 places, 192/270 transitions.
[2025-06-02 03:50:17] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:50:17] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:50:17] [INFO ] Input system was already deterministic with 192 transitions.
[2025-06-02 03:50:17] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:50:17] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:50:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11398571136594523752.gal : 1 ms
[2025-06-02 03:50:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12357870891764810485.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/CTLFireability11398571136594523752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12357870891764810485.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,2334,0.061389,5764,2,638,5,5535,6,0,864,7775,0


Converting to forward existential form...Done !
original formula: (EX(AG((task_s00000761_inputCriterion_s00000257_used==1))) + AF((decision_s00000773_input_s00000263==1)))
=> equivalent forward existential formula: [FwdG((Init * !(EX(!(E(TRUE U !((task_s00000761_inputCriterion_s00000257_used==1))))))),!((decision_s00000773_in...183
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t27, t28, t31, t32, t33, t38, t39, t43, t45, t50, t53, t54, t59, t67, t75, t119, t1...283
Hit Full ! (commute/partial/dont) 190/0/2
(forward)formula 0,0,0.602086,29012,1,0,347,101429,416,186,4937,117065,509
FORMULA IBM703-PT-none-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 219 transition count 247
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 219 transition count 247
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 61 place count 204 transition count 232
Iterating global reduction 0 with 15 rules applied. Total rules applied 76 place count 204 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 204 transition count 231
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 196 transition count 223
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 196 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 196 transition count 221
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 99 place count 192 transition count 217
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 192 transition count 217
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 107 place count 188 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 188 transition count 213
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 184 transition count 209
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 184 transition count 209
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 180 transition count 205
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 180 transition count 205
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 176 transition count 201
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 176 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 173 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 173 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 172 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 171 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 170 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 170 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 170 transition count 194
Applied a total of 148 rules in 23 ms. Remains 170 /242 variables (removed 72) and now considering 194/270 (removed 76) transitions.
// Phase 1: matrix 194 rows 170 cols
[2025-06-02 03:50:17] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-02 03:50:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:18] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-02 03:50:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 194/363 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 1/364 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 0/364 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 170 constraints, problems are : Problem set: 0 solved, 193 unsolved in 26030 ms.
Refiners :[State Equation: 170/170 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 194/363 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 193/362 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 1/364 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 363 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30021 ms.
Refiners :[State Equation: 170/170 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56061ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 56062ms
Starting structural reductions in LTL mode, iteration 1 : 170/242 places, 194/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56203 ms. Remains : 170/242 places, 194/270 transitions.
[2025-06-02 03:51:14] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:51:14] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:51:14] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-02 03:51:14] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:51:14] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:51:14] [INFO ] Time to serialize gal into /tmp/CTLFireability13415909308199183170.gal : 1 ms
[2025-06-02 03:51:14] [INFO ] Time to serialize properties into /tmp/CTLFireability587931238446291632.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/CTLFireability13415909308199183170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability587931238446291632.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,2342,0.06495,6032,2,665,5,5750,6,0,874,8656,0


Converting to forward existential form...Done !
original formula: AX((task_s00000731_inputCriterion_s00000257_used==0))
=> equivalent forward existential formula: [(EY(Init) * !((task_s00000731_inputCriterion_s00000257_used==0)))] = FALSE
(forward)formula 0,1,0.074586,6288,1,0,9,5750,9,2,1045,8656,2
FORMULA IBM703-PT-none-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Graph (complete) has 270 edges and 242 vertex of which 65 are kept as prefixes of interest. Removing 177 places using SCC suffix rule.3 ms
Discarding 177 places :
Also discarding 195 output transitions
Drop transitions (Output transitions of discarded places.) removed 195 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 64 transition count 23
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 14 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 11 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 110 place count 11 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 8 transition count 15
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 7 transition count 13
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 7 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 6 transition count 12
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 123 place count 6 transition count 9
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 5 transition count 7
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 1 rules applied. Total rules applied 127 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 128 place count 4 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 129 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 129 place count 4 transition count 4
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 131 place count 3 transition count 4
Applied a total of 131 rules in 16 ms. Remains 3 /242 variables (removed 239) and now considering 4/270 (removed 266) transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-02 03:51:14] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:51:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-02 03:51:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:51:14] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:51:14] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-06-02 03:51:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/242 places, 4/270 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 138 ms. Remains : 3/242 places, 4/270 transitions.
[2025-06-02 03:51:14] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:51:14] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:51:14] [INFO ] Input system was already deterministic with 4 transitions.
[2025-06-02 03:51:14] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:51:14] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:51:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14505598482610684440.gal : 0 ms
[2025-06-02 03:51:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14401193266072508072.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/CTLFireability14505598482610684440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14401193266072508072.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.001538,3660,2,6,5,21,6,0,16,15,0


Converting to forward existential form...Done !
original formula: AF(EG((callToProcess_s00000596_output_s00000264!=1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((callToProcess_s00000596_output_s00000264!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
dead was empty
(forward)formula 0,1,0.002398,3916,1,0,21,66,29,13,70,85,28
FORMULA IBM703-PT-none-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Graph (complete) has 270 edges and 242 vertex of which 135 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.1 ms
Discarding 107 places :
Also discarding 116 output transitions
Drop transitions (Output transitions of discarded places.) removed 116 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 134 transition count 66
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 101 rules applied. Total rules applied 189 place count 47 transition count 52
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 200 place count 38 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 202 place count 36 transition count 50
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 202 place count 36 transition count 45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 212 place count 31 transition count 45
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 213 place count 30 transition count 43
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 30 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 222 place count 26 transition count 39
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 2 rules applied. Total rules applied 224 place count 26 transition count 37
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 226 place count 25 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 25 transition count 34
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 229 place count 25 transition count 33
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 231 place count 24 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 232 place count 23 transition count 32
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 234 place count 23 transition count 32
Applied a total of 234 rules in 18 ms. Remains 23 /242 variables (removed 219) and now considering 32/270 (removed 238) transitions.
// Phase 1: matrix 32 rows 23 cols
[2025-06-02 03:51:14] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:51:14] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-02 03:51:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:51:14] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:51:14] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2025-06-02 03:51:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 32/54 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 23 constraints, problems are : Problem set: 0 solved, 31 unsolved in 399 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 32/54 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 31/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 1/55 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/55 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 54 constraints, problems are : Problem set: 0 solved, 31 unsolved in 384 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 786ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 786ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/242 places, 32/270 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 859 ms. Remains : 23/242 places, 32/270 transitions.
[2025-06-02 03:51:15] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:51:15] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:51:15] [INFO ] Input system was already deterministic with 32 transitions.
[2025-06-02 03:51:15] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:51:15] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:51:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1798278662474453379.gal : 0 ms
[2025-06-02 03:51:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3645316873245827473.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/CTLFireability1798278662474453379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3645316873245827473.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,30,0.00496,3912,2,59,5,263,6,0,118,224,0


Converting to forward existential form...Done !
original formula: (AF(!(E(!(A((decision_s00000783_input_s00000263==1) U (callToProcess_s00000808_output_s00000264==1))) U (task_s00000750_output_s00000264=...561
=> equivalent forward existential formula: (([(FwdU((Init * !(!(EG(!(!(E(!(!((E(!((callToProcess_s00000808_output_s00000264==1)) U (!((decision_s00000783_i...1737
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t6, t7, t9, t10, t13, t14, t17, t26, Intersection with reachable at each step enable...205
dead was empty
(forward)formula 0,1,0.02946,5064,1,0,167,5236,120,114,668,5939,232
FORMULA IBM703-PT-none-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 219 transition count 247
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 219 transition count 247
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 61 place count 204 transition count 232
Iterating global reduction 0 with 15 rules applied. Total rules applied 76 place count 204 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 204 transition count 231
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 196 transition count 223
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 196 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 196 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 191 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 191 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 187 transition count 212
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 187 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 183 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 183 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 181 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 181 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 179 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 179 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 177 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 177 transition count 202
Applied a total of 133 rules in 12 ms. Remains 177 /242 variables (removed 65) and now considering 202/270 (removed 68) transitions.
// Phase 1: matrix 202 rows 177 cols
[2025-06-02 03:51:15] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:51:15] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-02 03:51:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:51:15] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-02 03:51:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 202/378 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/379 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 0/379 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 177 constraints, problems are : Problem set: 0 solved, 201 unsolved in 28234 ms.
Refiners :[State Equation: 177/177 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 202/378 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 201/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 1/379 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/379 variables, and 378 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30018 ms.
Refiners :[State Equation: 177/177 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58260ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 58261ms
Starting structural reductions in LTL mode, iteration 1 : 177/242 places, 202/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58385 ms. Remains : 177/242 places, 202/270 transitions.
[2025-06-02 03:52:13] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:52:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:52:13] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-02 03:52:13] [INFO ] Flatten gal took : 5 ms
[2025-06-02 03:52:13] [INFO ] Flatten gal took : 6 ms
[2025-06-02 03:52:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8980614538967405196.gal : 1 ms
[2025-06-02 03:52:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17055370192299610924.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/CTLFireability8980614538967405196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17055370192299610924.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,3658,0.064811,6024,2,696,5,6533,6,0,910,8663,0


Converting to forward existential form...Done !
original formula: AG(((EF((task_s00000723_output_s00000264==0)) + (task_s00000749_inputCriterion_s00000257_used==0)) + (AF(((EF((task_s00000726_inputCriter...394
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !((E(TRUE U (task_s00000723_output_s00000264==0)) + (task_s00000749_inputCriterion_s00...617
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t27, t28, t29, t32, t34, t39, t40, t44, t46, t54, t55, t61, t69, t78, t122, t136, t...290
dead was empty
(forward)formula 0,1,1.73671,70876,1,0,744,423479,444,399,5001,357641,939
FORMULA IBM703-PT-none-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 270/270 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 223 transition count 251
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 223 transition count 251
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 52 place count 209 transition count 237
Iterating global reduction 0 with 14 rules applied. Total rules applied 66 place count 209 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 209 transition count 236
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 201 transition count 228
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 201 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 201 transition count 227
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 196 transition count 222
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 196 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 192 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 192 transition count 218
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 188 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 188 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 184 transition count 210
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 184 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 121 place count 181 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 124 place count 181 transition count 207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 179 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 179 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 178 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 178 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 177 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 177 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 176 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 176 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 176 transition count 201
Applied a total of 135 rules in 21 ms. Remains 176 /242 variables (removed 66) and now considering 201/270 (removed 69) transitions.
// Phase 1: matrix 201 rows 176 cols
[2025-06-02 03:52:15] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:15] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-02 03:52:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:15] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-02 03:52:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 201/376 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 1/377 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/377 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 176 constraints, problems are : Problem set: 0 solved, 200 unsolved in 26849 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 201/376 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 1/377 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/377 variables, and 376 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30012 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56869ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 56869ms
Starting structural reductions in LTL mode, iteration 1 : 176/242 places, 201/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57006 ms. Remains : 176/242 places, 201/270 transitions.
[2025-06-02 03:53:12] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:53:12] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:53:12] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-02 03:53:12] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:53:12] [INFO ] Flatten gal took : 3 ms
[2025-06-02 03:53:12] [INFO ] Time to serialize gal into /tmp/CTLFireability13065246591102088078.gal : 1 ms
[2025-06-02 03:53:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14010255180482829467.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/CTLFireability13065246591102088078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14010255180482829467.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,2652,0.071152,6516,2,877,5,7271,6,0,905,11269,0


Converting to forward existential form...Done !
original formula: AG(EF((AX(((A((task_s00000705_inputCriterion_s00000257_used==1) U (decision_s00000776_activated==1)) + (task_s00000738_output_s00000264==...328
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(EX(!(((!((E(!((decision_s00000776_activated==1)) U (!((task_s00000705_inputCri...501
Reverse transition relation is NOT exact ! Due to transitions t12, t24, t27, t28, t29, t30, t34, t35, t36, t37, t41, t42, t46, t48, t53, t56, t57, t62, t70...309
(forward)formula 0,1,1.74393,72608,1,0,683,409241,441,368,4970,377153,878
FORMULA IBM703-PT-none-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-02 03:53:14] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:53:14] [INFO ] Flatten gal took : 4 ms
Total runtime 750526 ms.

BK_STOP 1748836394331

--------------------
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="IBM703-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 IBM703-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-174876422500346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;