About the Execution of ITS-Tools for GPPP-PT-C0001N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 500046.00 | 0.00 | 0.00 | TTTFTTTTTFFTFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007600258.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 GPPP-PT-C0001N0000000100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007600258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 17 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1 May 29 14:32 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000100-CTLFireability-2023-12
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2023-13
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2023-14
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2023-15
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-00
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-01
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-02
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-03
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-04
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-05
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-06
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-07
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-08
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-09
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-10
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748909279866
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000000100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 00:08:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 00:08:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 00:08:02] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-06-03 00:08:02] [INFO ] Transformed 33 places.
[2025-06-03 00:08:02] [INFO ] Transformed 22 transitions.
[2025-06-03 00:08:02] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2025-06-03 00:08:02] [INFO ] Computed 13 invariants in 10 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2510ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 2537ms
[2025-06-03 00:08:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:08:04] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-03 00:08:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:08:04] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2025-06-03 00:08:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1361 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1785ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1786ms
Finished structural reductions in LTL mode , in 1 iterations and 4535 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2025-06-03 00:08:06] [INFO ] Flatten gal took : 29 ms
[2025-06-03 00:08:07] [INFO ] Flatten gal took : 11 ms
[2025-06-03 00:08:07] [INFO ] Input system was already deterministic with 22 transitions.
Reduction of identical properties reduced properties to check from 42 to 39
RANDOM walk for 40001 steps (8 resets) in 1135 ms. (35 steps per ms) remains 8/39 properties
BEST_FIRST walk for 40002 steps (8 resets) in 555 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 143 ms. (277 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
[2025-06-03 00:08:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 4/25 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 5 (OVERLAPS) 4/29 variables, 6/11 constraints. Problems are: Problem set: 4 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 20/49 variables, 29/40 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/52 variables, 2/42 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 1/43 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/52 variables, 0/43 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/55 variables, 2/45 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/55 variables, 1/46 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 4 solved, 3 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 5/13 variables, 2/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Int declared 28/55 variables, and 10 constraints, problems are : Problem set: 7 solved, 0 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 3/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 325ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
[2025-06-03 00:08:08] [INFO ] Flatten gal took : 7 ms
[2025-06-03 00:08:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 00:08:08] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:08:08] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
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 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 30 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 26 cols
[2025-06-03 00:08:08] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 17/43 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 17/43 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1122 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1424ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1425ms
[2025-06-03 00:08:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:08:09] [INFO ] Implicit Places using invariants in 58 ms returned [0, 1, 2, 15]
[2025-06-03 00:08:09] [INFO ] Actually due to overlaps returned [1, 15, 0]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 23/33 places, 17/22 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 23 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 14
Applied a total of 6 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 20 cols
[2025-06-03 00:08:09] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:08:09] [INFO ] Implicit Places using invariants in 43 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 19/33 places, 14/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1564 ms. Remains : 19/33 places, 14/22 transitions.
[2025-06-03 00:08:09] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:08:09] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:08:09] [INFO ] Input system was already deterministic with 14 transitions.
[2025-06-03 00:08:10] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:08:10] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:08:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13041795570532060144.gal : 2 ms
[2025-06-03 00:08:10] [INFO ] Time to serialize properties into /tmp/CTLFireability13468771015059213577.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/CTLFireability13041795570532060144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13468771015059213577.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,813,0.020736,3684,2,146,5,1112,6,0,93,1016,0
Converting to forward existential form...Done !
original formula: EF((AG(A(!(((GAP>=1)||((Ru5P>=1)&&(a2>=1)))) U ((NADH>=1)&&(Pyr>=1)))) + (AF((DHAP>=1)) * EF(((Ru5P>=1)&&(a1>=2))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(((NADH>=1)&&(Pyr>=1))) U (!(!(((GAP>=1)||((Ru5P>=1)&&(a2>=1))))) * !(((...314
Reverse transition relation is NOT exact ! Due to transitions t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.072606,5220,1,0,142,9317,65,56,678,8133,293
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2025-06-03 00:08:10] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1908ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1909ms
[2025-06-03 00:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:08:12] [INFO ] Implicit Places using invariants in 46 ms returned [0, 2, 19]
[2025-06-03 00:08:12] [INFO ] Actually due to overlaps returned [19, 0]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1958 ms. Remains : 31/33 places, 22/22 transitions.
[2025-06-03 00:08:12] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:08:12] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:08:12] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-03 00:08:12] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:08:12] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:08:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1907538046442853085.gal : 1 ms
[2025-06-03 00:08:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2286914133070170034.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/CTLFireability1907538046442853085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2286914133070170034.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 00:08:42] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:08:42] [INFO ] Applying decomposition
[2025-06-03 00:08:42] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5982961944118291543.txt' '-o' '/tmp/graph5982961944118291543.bin' '-w' '/tmp/graph5982961944118291543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5982961944118291543.bin' '-l' '-1' '-v' '-w' '/tmp/graph5982961944118291543.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:08:42] [INFO ] Decomposing Gal with order
[2025-06-03 00:08:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:08:42] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 00:08:42] [INFO ] Flatten gal took : 53 ms
[2025-06-03 00:08:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 00:08:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16415583465542475750.gal : 2 ms
[2025-06-03 00:08:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2763571670927616449.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/CTLFireability16415583465542475750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2763571670927616449.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45477e+08,8.42862,204408,718,554,295967,210666,115,411068,76,583657,0
Converting to forward existential form...Done !
original formula: E(EF(((i2.u6.start>=1) + (EX(((u8.Xu5P>=1)&&(u3.E4P>=1))) * AG(A(((u8.Xu5P>=1)&&(u3.E4P>=1)) U ((u8.Ru5P>=1)&&(u8.a1>=2))))))) U AF((AF((...397
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((i2.u6.start>=1) + (EX(((u8.Xu5P>=1)&&(u3.E4P>=1))) * !(E(TRUE U !(!((E(!(((u8.Ru5P>=1)&&(...605
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
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 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 10 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 26 cols
[2025-06-03 00:09:12] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 17/43 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 17/43 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1182 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1535ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1536ms
[2025-06-03 00:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:09:14] [INFO ] Implicit Places using invariants in 52 ms returned [0, 1, 2, 3, 15]
[2025-06-03 00:09:14] [INFO ] Actually due to overlaps returned [1, 15, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 22/33 places, 17/22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 18 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 16 transition count 12
Applied a total of 11 rules in 6 ms. Remains 16 /22 variables (removed 6) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 16 cols
[2025-06-03 00:09:14] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:09:14] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-03 00:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:09:14] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 16/33 places, 12/22 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1693 ms. Remains : 16/33 places, 12/22 transitions.
[2025-06-03 00:09:14] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:14] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:09:14] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 00:09:14] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:09:14] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5968762032062376819.gal : 1 ms
[2025-06-03 00:09:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1858396528208291485.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/CTLFireability5968762032062376819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1858396528208291485.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,195,0.009352,3896,2,184,5,743,6,0,79,622,0
Converting to forward existential form...Done !
original formula: AF((AG(EF((DHAP>=1))) + (DHAP>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(E(TRUE U (DHAP>=1))))) + (DHAP>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.027471,4408,1,0,28,2498,49,17,545,2003,38
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 29 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 27 transition count 18
Applied a total of 9 rules in 13 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 27 cols
[2025-06-03 00:09:14] [INFO ] Computed 11 invariants in 1 ms
[2025-06-03 00:09:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 17/44 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/45 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/45 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 39 constraints, problems are : Problem set: 0 solved, 17 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 17/44 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/45 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/45 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 56 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1497 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1948ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1948ms
[2025-06-03 00:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:09:16] [INFO ] Implicit Places using invariants in 83 ms returned [0, 1, 2, 3, 14]
[2025-06-03 00:09:16] [INFO ] Actually due to overlaps returned [1, 14, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 23/33 places, 18/22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 22 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 21 transition count 16
Applied a total of 4 rules in 3 ms. Remains 21 /23 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 21 cols
[2025-06-03 00:09:16] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:09:16] [INFO ] Implicit Places using invariants in 40 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 20/33 places, 16/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 2092 ms. Remains : 20/33 places, 16/22 transitions.
[2025-06-03 00:09:16] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:16] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:16] [INFO ] Input system was already deterministic with 16 transitions.
[2025-06-03 00:09:16] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:16] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:16] [INFO ] Time to serialize gal into /tmp/CTLFireability2775935572405272912.gal : 0 ms
[2025-06-03 00:09:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2029047759539299536.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/CTLFireability2775935572405272912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2029047759539299536.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,618,0.010184,3916,2,260,5,1171,6,0,99,863,0
Converting to forward existential form...Done !
original formula: (EF((((_3PG>=1)&&(FBP<1))&&(start>=1))) + AG(EF(EG(((G6P<1)||(b1<3))))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U (((_3PG>=1)&&(FBP<1))&&(start>=1))))),TRUE) * !(E(TRUE U EG(((G6P<1)||(b1<3))))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.041598,4812,1,0,85,4889,56,36,674,4223,150
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2025-06-03 00:09:16] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1828ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1828ms
[2025-06-03 00:09:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:09:18] [INFO ] Implicit Places using invariants in 51 ms returned [0, 1, 2, 19]
[2025-06-03 00:09:18] [INFO ] Actually due to overlaps returned [1, 19, 0]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1882 ms. Remains : 30/33 places, 22/22 transitions.
[2025-06-03 00:09:18] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:18] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:18] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-03 00:09:18] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:18] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9849560462895144325.gal : 0 ms
[2025-06-03 00:09:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17244726430995881601.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/CTLFireability9849560462895144325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17244726430995881601.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45477e+08,19.1854,294728,2,17571,5,1.32856e+06,6,0,145,1.57871e+06,0
Converting to forward existential form...Done !
original formula: AG((EX(EF(((NADH>=1)&&(Pyr>=1)))) + AG(EF(((Ru5P<1)||(a2<1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EX(E(TRUE U ((NADH>=1)&&(Pyr>=1)))))),TRUE) * !(E(TRUE U ((Ru5P<1)||(a2<1)))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,21.2071,294728,1,0,43,1.32856e+06,63,24,1548,1.57871e+06,53
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 29 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 8 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 26 cols
[2025-06-03 00:09:39] [INFO ] Computed 11 invariants in 13 ms
[2025-06-03 00:09:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 16/42 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 38 constraints, problems are : Problem set: 0 solved, 16 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 16/42 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/43 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 54 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1537ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1537ms
[2025-06-03 00:09:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:09:41] [INFO ] Implicit Places using invariants in 65 ms returned [0, 1, 2, 3, 13]
[2025-06-03 00:09:41] [INFO ] Actually due to overlaps returned [1, 13, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 22/33 places, 17/22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 18 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 10 place count 17 transition count 12
Applied a total of 10 rules in 9 ms. Remains 17 /22 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 17 cols
[2025-06-03 00:09:41] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:09:41] [INFO ] Implicit Places using invariants in 44 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 16/33 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1679 ms. Remains : 16/33 places, 12/22 transitions.
[2025-06-03 00:09:41] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:09:41] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:09:41] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 00:09:41] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:41] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:09:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2011092201664431493.gal : 0 ms
[2025-06-03 00:09:41] [INFO ] Time to serialize properties into /tmp/CTLFireability600456670425791183.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/CTLFireability2011092201664431493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability600456670425791183.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,239,0.008562,3896,2,307,5,1268,6,0,81,827,0
Converting to forward existential form...Done !
original formula: EF(EG(AG((_2PG>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !((_2PG>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.039021,5048,1,0,27,5992,49,15,540,4341,34
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2025-06-03 00:09:41] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1518 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1956ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1956ms
[2025-06-03 00:09:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:09:43] [INFO ] Implicit Places using invariants in 55 ms returned [0, 2, 3, 19]
[2025-06-03 00:09:43] [INFO ] Actually due to overlaps returned [19, 0, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2016 ms. Remains : 30/33 places, 22/22 transitions.
[2025-06-03 00:09:43] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:09:43] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:43] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-03 00:09:43] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:43] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:09:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8766543706876425691.gal : 1 ms
[2025-06-03 00:09:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13443377456815593481.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/CTLFireability8766543706876425691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13443377456815593481.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 00:10:13] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:10:13] [INFO ] Applying decomposition
[2025-06-03 00:10:13] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5176840398473383431.txt' '-o' '/tmp/graph5176840398473383431.bin' '-w' '/tmp/graph5176840398473383431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5176840398473383431.bin' '-l' '-1' '-v' '-w' '/tmp/graph5176840398473383431.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:10:13] [INFO ] Decomposing Gal with order
[2025-06-03 00:10:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:10:13] [INFO ] Removed a total of 2 redundant transitions.
[2025-06-03 00:10:13] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:10:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 00:10:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2188548496813778132.gal : 1 ms
[2025-06-03 00:10:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8692850243025329449.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/CTLFireability2188548496813778132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8692850243025329449.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2025-06-03 00:10:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1685ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1686ms
[2025-06-03 00:10:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:10:45] [INFO ] Implicit Places using invariants in 63 ms returned [0, 2, 3]
[2025-06-03 00:10:45] [INFO ] Actually due to overlaps returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1752 ms. Remains : 31/33 places, 22/22 transitions.
[2025-06-03 00:10:45] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:10:45] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:10:45] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-03 00:10:45] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:10:45] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:10:45] [INFO ] Time to serialize gal into /tmp/CTLFireability7473294935663631617.gal : 0 ms
[2025-06-03 00:10:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9665354854923009053.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/CTLFireability7473294935663631617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9665354854923009053.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 00:11:15] [INFO ] Flatten gal took : 7 ms
[2025-06-03 00:11:15] [INFO ] Applying decomposition
[2025-06-03 00:11:15] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4245097744470889493.txt' '-o' '/tmp/graph4245097744470889493.bin' '-w' '/tmp/graph4245097744470889493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4245097744470889493.bin' '-l' '-1' '-v' '-w' '/tmp/graph4245097744470889493.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:11:15] [INFO ] Decomposing Gal with order
[2025-06-03 00:11:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:11:15] [INFO ] Removed a total of 2 redundant transitions.
[2025-06-03 00:11:15] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 00:11:15] [INFO ] Time to serialize gal into /tmp/CTLFireability12539559296030958317.gal : 1 ms
[2025-06-03 00:11:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6394221197395004892.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/CTLFireability12539559296030958317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6394221197395004892.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2025-06-03 00:11:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1558ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1558ms
[2025-06-03 00:11:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:11:47] [INFO ] Implicit Places using invariants in 38 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1599 ms. Remains : 32/33 places, 22/22 transitions.
[2025-06-03 00:11:47] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:11:47] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:11:47] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-03 00:11:47] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:11:47] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:11:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9451703607699325357.gal : 0 ms
[2025-06-03 00:11:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15421562630358290281.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/CTLFireability9451703607699325357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15421562630358290281.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 00:12:17] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:12:17] [INFO ] Applying decomposition
[2025-06-03 00:12:17] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3982477595567075806.txt' '-o' '/tmp/graph3982477595567075806.bin' '-w' '/tmp/graph3982477595567075806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3982477595567075806.bin' '-l' '-1' '-v' '-w' '/tmp/graph3982477595567075806.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:12:17] [INFO ] Decomposing Gal with order
[2025-06-03 00:12:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:12:17] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 00:12:17] [INFO ] Flatten gal took : 5 ms
[2025-06-03 00:12:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 00:12:17] [INFO ] Time to serialize gal into /tmp/CTLFireability6086613447612170154.gal : 2 ms
[2025-06-03 00:12:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10254756333198040685.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/CTLFireability6086613447612170154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10254756333198040685.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2025-06-03 00:12:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1251 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1606ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1607ms
[2025-06-03 00:12:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:12:48] [INFO ] Implicit Places using invariants in 48 ms returned [0, 1, 2, 3, 19]
[2025-06-03 00:12:48] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1667 ms. Remains : 29/33 places, 22/22 transitions.
[2025-06-03 00:12:48] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:12:48] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:12:48] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-03 00:12:48] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:12:48] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:12:48] [INFO ] Time to serialize gal into /tmp/CTLFireability12065929105177675598.gal : 0 ms
[2025-06-03 00:12:48] [INFO ] Time to serialize properties into /tmp/CTLFireability12842864986587415638.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/CTLFireability12065929105177675598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12842864986587415638.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45477e+08,21.3982,295956,2,17562,5,1.2993e+06,6,0,141,1.53483e+06,0
Converting to forward existential form...Done !
original formula: AG(AF(E(E(EF((DHAP>=1)) U (GAP<1)) U (EF((GSH>=2)) + EX(((NADPH>=1)&&(GSSG>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(E(E(TRUE U (DHAP>=1)) U (GAP<1)) U (E(TRUE U (GSH>=2)) + EX(((NADPH>=1)&&(GSSG>=1)))))...166
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,24.2982,295956,1,0,50,1.2993e+06,72,31,1537,1.53483e+06,73
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-10 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 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2025-06-03 00:13:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1567ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1567ms
[2025-06-03 00:13:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:13:14] [INFO ] Implicit Places using invariants in 57 ms returned [0, 1, 2, 3, 19]
[2025-06-03 00:13:14] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1628 ms. Remains : 29/33 places, 22/22 transitions.
[2025-06-03 00:13:14] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:13:14] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:13:14] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-03 00:13:14] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:13:14] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:13:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17000742995452163487.gal : 0 ms
[2025-06-03 00:13:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9735096469629918864.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/CTLFireability17000742995452163487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9735096469629918864.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45477e+08,20.2946,296172,2,17562,5,1.2993e+06,6,0,141,1.53483e+06,0
Converting to forward existential form...Done !
original formula: AG((AX(((G6P>=1)&&(b1>=3))) + EF((((S7P>=1)&&(GAP>=1))&&(c1>=7)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(E(TRUE U (((S7P>=1)&&(GAP>=1))&&(c1>=7)))))) * !(((G6P>=1)&&(b1>=3))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,22.5127,296172,1,0,45,1.2993e+06,65,26,1517,1.53483e+06,57
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2025-06-03 00:13:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1217 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1598ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1599ms
[2025-06-03 00:13:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:13:39] [INFO ] Implicit Places using invariants in 49 ms returned [0, 2]
[2025-06-03 00:13:39] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1654 ms. Remains : 32/33 places, 22/22 transitions.
[2025-06-03 00:13:39] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:13:39] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:13:39] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-03 00:13:39] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:13:39] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:13:39] [INFO ] Time to serialize gal into /tmp/CTLFireability11232646444253291444.gal : 1 ms
[2025-06-03 00:13:39] [INFO ] Time to serialize properties into /tmp/CTLFireability15287677971251678884.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/CTLFireability11232646444253291444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15287677971251678884.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45477e+08,10.3937,138904,2,42269,5,516137,6,0,157,546852,0
Converting to forward existential form...Done !
original formula: A(!(((_1_3_BPG>=1)&&(ADP>=1))) U EX((((A((FBP<1) U (((NADH>=1)&&(Pyr>=1)) + AG(((ATP>=1)&&(Gluc>=1))))) + A(!(((ATP>=1)&&(F6P>=1))) U !((...254
=> equivalent forward existential formula: [((Init * !(EG(!(EX((((!((E(!((((NADH>=1)&&(Pyr>=1)) + !(E(TRUE U !(((ATP>=1)&&(Gluc>=1))))))) U (!((FBP<1)) * !...1503
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-03 00:14:09] [INFO ] Flatten gal took : 3 ms
[2025-06-03 00:14:09] [INFO ] Applying decomposition
[2025-06-03 00:14:09] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3262685182984896413.txt' '-o' '/tmp/graph3262685182984896413.bin' '-w' '/tmp/graph3262685182984896413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3262685182984896413.bin' '-l' '-1' '-v' '-w' '/tmp/graph3262685182984896413.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:14:09] [INFO ] Decomposing Gal with order
[2025-06-03 00:14:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:14:09] [INFO ] Removed a total of 3 redundant transitions.
[2025-06-03 00:14:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:14:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 00:14:09] [INFO ] Time to serialize gal into /tmp/CTLFireability558529827787301349.gal : 1 ms
[2025-06-03 00:14:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4874159421927414209.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/CTLFireability558529827787301349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4874159421927414209.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45477e+08,9.78781,222948,963,529,367514,178904,126,436989,66,524149,0
Converting to forward existential form...Done !
original formula: A(!(((u6._1_3_BPG>=1)&&(i0.u0.ADP>=1))) U EX((((A((i2.u4.FBP<1) U (((i0.u1.NADH>=1)&&(i0.u1.Pyr>=1)) + AG(((i0.u0.ATP>=1)&&(i0.u0.Gluc>=1...344
=> equivalent forward existential formula: [((Init * !(EG(!(EX((((!((E(!((((i0.u1.NADH>=1)&&(i0.u1.Pyr>=1)) + !(E(TRUE U !(((i0.u0.ATP>=1)&&(i0.u0.Gluc>=1)...1971
Reverse transition relation is NOT exact ! Due to transitions i2.t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...167
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 31 transition count 20
Applied a total of 4 rules in 4 ms. Remains 31 /33 variables (removed 2) and now considering 20/22 (removed 2) transitions.
Running 19 sub problems to find dead transitions.
// Phase 1: matrix 20 rows 31 cols
[2025-06-03 00:14:39] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 20/51 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 44 constraints, problems are : Problem set: 0 solved, 19 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 20/51 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 63 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1560ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 1560ms
[2025-06-03 00:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:14:40] [INFO ] Implicit Places using invariants in 46 ms returned [0, 1, 2, 3, 19]
[2025-06-03 00:14:40] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 27/33 places, 20/22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 27 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 25 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 25 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 24 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 22 transition count 16
Applied a total of 9 rules in 4 ms. Remains 22 /27 variables (removed 5) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 22 cols
[2025-06-03 00:14:40] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:14:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-03 00:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:14:41] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 22/33 places, 16/22 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1709 ms. Remains : 22/33 places, 16/22 transitions.
[2025-06-03 00:14:41] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:14:41] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:14:41] [INFO ] Input system was already deterministic with 16 transitions.
[2025-06-03 00:14:41] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:14:41] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15867584197021400900.gal : 1 ms
[2025-06-03 00:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11771011386787271518.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/CTLFireability15867584197021400900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11771011386787271518.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44067e+06,3.56506,47308,2,3834,5,157206,6,0,107,181406,0
Converting to forward existential form...Done !
original formula: EG((EG((((S7P<1)||(GAP<1))||(c1<7))) * ((AF(EG((((NADPplus<2)||(G6P<1))||(b2<1)))) + (start>=1)) + ((NADPH>=1)&&(GSSG>=1)))))
=> equivalent forward existential formula: [FwdG(Init,(EG((((S7P<1)||(GAP<1))||(c1<7))) * ((!(EG(!(EG((((NADPplus<2)||(G6P<1))||(b2<1)))))) + (start>=1)) +...192
Reverse transition relation is NOT exact ! Due to transitions t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,20.549,313468,1,0,4092,1.79933e+06,69,1551,1333,1.55531e+06,8636
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2025-06-03 00:15:01] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1428 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1807ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1808ms
[2025-06-03 00:15:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:15:03] [INFO ] Implicit Places using invariants in 65 ms returned [0, 1, 2, 3, 19]
[2025-06-03 00:15:03] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1876 ms. Remains : 29/33 places, 22/22 transitions.
[2025-06-03 00:15:03] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:15:03] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:15:03] [INFO ] Input system was already deterministic with 22 transitions.
[2025-06-03 00:15:03] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:15:03] [INFO ] Flatten gal took : 1 ms
[2025-06-03 00:15:03] [INFO ] Time to serialize gal into /tmp/CTLFireability1804029617618262345.gal : 0 ms
[2025-06-03 00:15:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17744882217484001150.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/CTLFireability1804029617618262345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17744882217484001150.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45477e+08,20.7464,296360,2,17562,5,1.2993e+06,6,0,141,1.53483e+06,0
Converting to forward existential form...Done !
original formula: EX((EG(EF((FBP>=1))) * (_3PG>=1)))
=> equivalent forward existential formula: [FwdG((EY(Init) * (_3PG>=1)),E(TRUE U (FBP>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,23.2929,296360,1,0,44,1.2993e+06,67,27,1528,1.53483e+06,60
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-03 00:15:26] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:15:26] [INFO ] Flatten gal took : 2 ms
[2025-06-03 00:15:26] [INFO ] Applying decomposition
[2025-06-03 00:15:26] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10182913992089718455.txt' '-o' '/tmp/graph10182913992089718455.bin' '-w' '/tmp/graph10182913992089718455.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10182913992089718455.bin' '-l' '-1' '-v' '-w' '/tmp/graph10182913992089718455.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:15:27] [INFO ] Decomposing Gal with order
[2025-06-03 00:15:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:15:27] [INFO ] Removed a total of 2 redundant transitions.
[2025-06-03 00:15:27] [INFO ] Flatten gal took : 4 ms
[2025-06-03 00:15:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 00:15:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16143702018335615551.gal : 1 ms
[2025-06-03 00:15:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3825581611833730884.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/CTLFireability16143702018335615551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3825581611833730884.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45477e+08,9.60602,219324,673,551,399896,164657,133,461203,71,493648,0
Converting to forward existential form...Done !
original formula: E(EF(((i2.u6.start>=1) + (EX(((u8.Xu5P>=1)&&(i4.u4.E4P>=1))) * AG(A(((u8.Xu5P>=1)&&(i4.u4.E4P>=1)) U ((u8.Ru5P>=1)&&(u8.a1>=2))))))) U AF...406
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((i2.u6.start>=1) + (EX(((u8.Xu5P>=1)&&(i4.u4.E4P>=1))) * !(E(TRUE U !(!((E(!(((u8.Ru5P>=1)...620
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,42.5997,857876,1,0,2.31646e+06,429382,764,1.33696e+06,886,1.07241e+06,1369294
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EX(AG(E(!(EG(!(((i1.u7.G6P<1)||(i1.u7.b1<3))))) U AF(!(((i2.u0.ATP>=7)&&(i2.u1.Lac>=7)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(!(EG(!(((i1.u7.G6P<1)||(i1.u7.b1<3))))) U !(EG(!(!(((i2.u0.ATP>=7)&&(i2.u1.Lac>=7)))...173
(forward)formula 1,1,42.7843,866580,1,0,2.33302e+06,429382,804,1.33849e+06,888,1.07241e+06,1436799
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: E(((AG(AF((u5._2PG>=1))) * EG(EF((i4.u4.FBP>=1)))) * ((AF(EX(((i2.u0.ADP>=1)&&(u5.PEP>=1)))) + EX(((u5._2PG>=1)||((i1.u2.NADPH>=1)&&(i1.u...534
=> equivalent forward existential formula: ([FwdG(FwdU(Init,((!(E(TRUE U !(!(EG(!((u5._2PG>=1))))))) * EG(E(TRUE U (i4.u4.FBP>=1)))) * ((!(EG(!(EX(((i2.u0....1149
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 2,0,49.0807,1007636,1,0,2.69679e+06,431300,869,1.51434e+06,888,1.08559e+06,1781261
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG((EF(((i2.u0.ATP>=7)&&(i2.u1.Lac>=7))) + ((EX(A(((u8.Xu5P>=1)&&(u8.R5P>=1)) U ((i1.u2.NADPH>=1)&&(i1.u3.GSSG>=1)))) + ((((i4.u4.FBP<1)&...450
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((EX(!((E(!(((i1.u2.NADPH>=1)&&(i1.u3.GSSG>=1))) U (!(((u8.Xu5P>=1)&&(u8.R5P>=1))) * !(((...618
(forward)formula 3,1,49.0849,1007636,1,0,2.69692e+06,431300,869,1.51448e+06,888,1.08559e+06,1781679
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A(!(((i2.u0._1_3_BPG>=1)&&(i2.u0.ADP>=1))) U EX((((A((i4.u4.FBP<1) U (((i2.u1.NADH>=1)&&(i2.u1.Pyr>=1)) + AG(((i2.u0.ATP>=1)&&(i2.u6.Gluc...341
=> equivalent forward existential formula: [((Init * !(EG(!(EX((((!((E(!((((i2.u1.NADH>=1)&&(i2.u1.Pyr>=1)) + !(E(TRUE U !(((i2.u0.ATP>=1)&&(i2.u6.Gluc>=1)...1938
Fast SCC detection found an SCC at level 4
(forward)formula 4,1,52.5868,1079444,1,0,2.8566e+06,431535,906,1.59879e+06,891,1.09043e+06,1929792
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 498039 ms.
BK_STOP 1748909779912
--------------------
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="GPPP-PT-C0001N0000000100"
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 GPPP-PT-C0001N0000000100, 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 r100-smll-174867007600258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;