About the Execution of ITS-Tools for HealthRecord-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 223389.00 | 0.00 | 0.00 | FFFFTTFFFFFTFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008100538.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 HealthRecord-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008100538
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 46K 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 HealthRecord-PT-01-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-15
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-00
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-01
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-02
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-03
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-04
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-05
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-06
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-07
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-08
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-09
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-10
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748995845859
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-04 00:10:48] [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-04 00:10:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 00:10:48] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2025-06-04 00:10:48] [INFO ] Transformed 117 places.
[2025-06-04 00:10:48] [INFO ] Transformed 218 transitions.
[2025-06-04 00:10:48] [INFO ] Found NUPN structural information;
[2025-06-04 00:10:48] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 352 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
FORMULA HealthRecord-PT-01-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 73 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 213/213 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 182
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 182
Applied a total of 32 rules in 42 ms. Remains 101 /117 variables (removed 16) and now considering 182/213 (removed 31) transitions.
[2025-06-04 00:10:48] [INFO ] Flow matrix only has 175 transitions (discarded 7 similar events)
// Phase 1: matrix 175 rows 101 cols
[2025-06-04 00:10:48] [INFO ] Computed 13 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:10:49] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-06-04 00:10:49] [INFO ] Flow matrix only has 175 transitions (discarded 7 similar events)
[2025-06-04 00:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:10:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:10:49] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-06-04 00:10:49] [INFO ] Flow matrix only has 175 transitions (discarded 7 similar events)
[2025-06-04 00:10:49] [INFO ] Invariant cache hit.
[2025-06-04 00:10:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:52] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:52] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:52] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:53] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:53] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:53] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:53] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:53] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:53] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:53] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:53] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:54] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:54] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:54] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:54] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:54] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:54] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:54] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:54] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:54] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:55] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:56] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:56] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:56] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:56] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:56] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:57] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:57] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:57] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 174/275 variables, 101/143 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:00] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:00] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:00] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:01] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:01] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:01] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:01] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:01] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:01] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:01] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:01] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:01] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:03] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:06] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:06] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:06] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:06] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:06] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:06] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:06] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:06] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 8/164 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 1/276 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (OVERLAPS) 0/276 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 165 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25102 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:16] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:16] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:16] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:16] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:16] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:16] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:18] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:18] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:18] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 174/275 variables, 101/173 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 181/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 1/276 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/276 variables, and 355 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55333ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 55355ms
Starting structural reductions in LTL mode, iteration 1 : 101/117 places, 182/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56219 ms. Remains : 101/117 places, 182/213 transitions.
Support contains 73 out of 101 places after structural reductions.
[2025-06-04 00:11:45] [INFO ] Flatten gal took : 71 ms
[2025-06-04 00:11:45] [INFO ] Flatten gal took : 33 ms
[2025-06-04 00:11:45] [INFO ] Input system was already deterministic with 182 transitions.
RANDOM walk for 40000 steps (2112 resets) in 2547 ms. (15 steps per ms) remains 18/69 properties
BEST_FIRST walk for 4004 steps (30 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (33 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (34 resets) in 53 ms. (74 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (26 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (32 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (32 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (33 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (32 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (33 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (33 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (30 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (34 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (33 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
[2025-06-04 00:11:46] [INFO ] Flow matrix only has 175 transitions (discarded 7 similar events)
[2025-06-04 00:11:46] [INFO ] Invariant cache hit.
[2025-06-04 00:11:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/72 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:46] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:46] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 3/11 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 29/101 variables, 6/17 constraints. Problems are: Problem set: 3 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 7 ms to minimize.
Problem AtomicPropp16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:47] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 12/29 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 7/36 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:48] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 1/37 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 174/275 variables, 101/138 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:49] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 1/139 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/139 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 1/276 variables, 1/140 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 0/140 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/276 variables, 0/140 constraints. Problems are: Problem set: 4 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 140 constraints, problems are : Problem set: 4 solved, 14 unsolved in 3364 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 53/70 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 4/11 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 31/101 variables, 6/17 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 21/38 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:50] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:50] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:50] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 3/41 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/41 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 174/275 variables, 101/142 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 14/156 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/156 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/276 variables, 1/157 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/157 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:51] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:52] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:52] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:52] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 8 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/276 variables, 4/161 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 0/161 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:53] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 7 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/276 variables, 1/162 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/276 variables, 0/162 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/276 variables, 0/162 constraints. Problems are: Problem set: 4 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 162 constraints, problems are : Problem set: 4 solved, 14 unsolved in 4106 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/18 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7484ms problems are : Problem set: 4 solved, 14 unsolved
Finished Parikh walk after 105 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=105 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 14 properties in 787 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2025-06-04 00:11:54] [INFO ] Flatten gal took : 22 ms
[2025-06-04 00:11:54] [INFO ] Flatten gal took : 22 ms
[2025-06-04 00:11:55] [INFO ] Input system was already deterministic with 182 transitions.
Support contains 68 out of 101 places (down from 69) after GAL structural reductions.
Computed a total of 9 stabilizing places and 16 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Graph (trivial) has 140 edges and 101 vertex of which 14 / 101 are part of one of the 7 SCC in 4 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 39 place count 55 transition count 104
Iterating global reduction 0 with 38 rules applied. Total rules applied 77 place count 55 transition count 104
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 88 place count 44 transition count 82
Iterating global reduction 0 with 11 rules applied. Total rules applied 99 place count 44 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 104 place count 44 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 42 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 42 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 40 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 40 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 114 place count 40 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 40 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 123 place count 38 transition count 58
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 35 transition count 55
Applied a total of 126 rules in 59 ms. Remains 35 /101 variables (removed 66) and now considering 55/182 (removed 127) transitions.
[2025-06-04 00:11:55] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 35 cols
[2025-06-04 00:11:55] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:11:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-04 00:11:55] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
[2025-06-04 00:11:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:11:55] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:11:55] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2025-06-04 00:11:55] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
[2025-06-04 00:11:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 7/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:55] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:55] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 47/82 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/83 variables, and 45 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1353 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 7/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:56] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 47/82 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 41/87 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/83 variables, and 87 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1419 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2787ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2788ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/101 places, 55/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2953 ms. Remains : 35/101 places, 55/182 transitions.
[2025-06-04 00:11:58] [INFO ] Flatten gal took : 7 ms
[2025-06-04 00:11:58] [INFO ] Flatten gal took : 8 ms
[2025-06-04 00:11:58] [INFO ] Input system was already deterministic with 55 transitions.
[2025-06-04 00:11:58] [INFO ] Flatten gal took : 7 ms
[2025-06-04 00:11:58] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:11:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14914210499127618053.gal : 3 ms
[2025-06-04 00:11:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11870551531994323324.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14914210499127618053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11870551531994323324.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,7924,0.040353,4060,2,272,5,1459,6,0,183,1490,0
Converting to forward existential form...Done !
original formula: EF(AG((p7==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p7==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t25, t26, Interse...245
(forward)formula 0,1,0.113899,5468,1,0,107,9725,124,50,1212,7202,115
FORMULA HealthRecord-PT-01-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 61 transition count 107
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 61 transition count 107
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 54 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 54 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 52 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 52 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 50 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 50 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 50 transition count 79
Applied a total of 106 rules in 15 ms. Remains 50 /101 variables (removed 51) and now considering 79/182 (removed 103) transitions.
[2025-06-04 00:11:58] [INFO ] Flow matrix only has 77 transitions (discarded 2 similar events)
// Phase 1: matrix 77 rows 50 cols
[2025-06-04 00:11:58] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:11:58] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 00:11:58] [INFO ] Flow matrix only has 77 transitions (discarded 2 similar events)
[2025-06-04 00:11:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:11:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:11:58] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2025-06-04 00:11:58] [INFO ] Flow matrix only has 77 transitions (discarded 2 similar events)
[2025-06-04 00:11:58] [INFO ] Invariant cache hit.
[2025-06-04 00:11:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:59] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:59] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:59] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:11:59] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 76/126 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:01] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 64 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4189 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 76/126 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 78/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 142 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4348 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8558ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 8559ms
Starting structural reductions in LTL mode, iteration 1 : 50/101 places, 79/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8745 ms. Remains : 50/101 places, 79/182 transitions.
[2025-06-04 00:12:06] [INFO ] Flatten gal took : 7 ms
[2025-06-04 00:12:07] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:12:07] [INFO ] Input system was already deterministic with 79 transitions.
[2025-06-04 00:12:07] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:12:07] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:12:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2210463634222138274.gal : 2 ms
[2025-06-04 00:12:07] [INFO ] Time to serialize properties into /tmp/CTLFireability15399359190185706137.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/CTLFireability2210463634222138274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15399359190185706137.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,58815,0.029686,4520,2,579,5,2684,6,0,274,2548,0
Converting to forward existential form...Done !
original formula: EF((EX(EF(AX((p55==0)))) * !(E((((p20!=1) * AG((p12==1))) + ((!((p16==1)&&(p114==1)))&&(p112!=1))) U EF(EG((p102==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(E(TRUE U !(EX(!((p55==0))))))) * !(E((((p20!=1) * !(E(TRUE U !((p12==1))))) + ((!((p16==...222
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...317
(forward)formula 0,1,0.240023,11176,1,0,202,36795,191,99,1864,34585,238
FORMULA HealthRecord-PT-01-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 57 transition count 100
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 57 transition count 100
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 97 place count 48 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 106 place count 48 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 110 place count 48 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 46 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 46 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 44 transition count 68
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 44 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 44 transition count 66
Applied a total of 120 rules in 8 ms. Remains 44 /101 variables (removed 57) and now considering 66/182 (removed 116) transitions.
[2025-06-04 00:12:07] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
// Phase 1: matrix 65 rows 44 cols
[2025-06-04 00:12:07] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:07] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-04 00:12:07] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2025-06-04 00:12:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:12:07] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2025-06-04 00:12:07] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2025-06-04 00:12:07] [INFO ] Invariant cache hit.
[2025-06-04 00:12:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:07] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:08] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 64/108 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 54 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2631 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:10] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:10] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:10] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 64/108 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 65/121 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/109 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 122 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3695 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6339ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 6340ms
Starting structural reductions in LTL mode, iteration 1 : 44/101 places, 66/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6464 ms. Remains : 44/101 places, 66/182 transitions.
[2025-06-04 00:12:13] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:12:13] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:12:13] [INFO ] Input system was already deterministic with 66 transitions.
[2025-06-04 00:12:13] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:12:13] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:12:13] [INFO ] Time to serialize gal into /tmp/CTLFireability12366684793355731816.gal : 1 ms
[2025-06-04 00:12:13] [INFO ] Time to serialize properties into /tmp/CTLFireability835455291560658581.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/CTLFireability12366684793355731816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability835455291560658581.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,36459,0.0178,4288,2,343,5,1513,6,0,240,1225,0
Converting to forward existential form...Done !
original formula: EX(AX(AG(!(E(((p16==1)&&(p97==1)) U ((p71==1)&&(p96==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(E(TRUE U !(!(E(((p16==1)&&(p97==1)) U ((p71==1)&&(p96==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t21, t23, t55, ...252
(forward)formula 0,0,0.07968,6208,1,0,127,10477,155,65,1601,7943,166
FORMULA HealthRecord-PT-01-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 67 transition count 119
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 67 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 60 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 60 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 60 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 58 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 58 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 57 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 57 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 91 place count 57 transition count 94
Applied a total of 91 rules in 19 ms. Remains 57 /101 variables (removed 44) and now considering 94/182 (removed 88) transitions.
[2025-06-04 00:12:13] [INFO ] Flow matrix only has 92 transitions (discarded 2 similar events)
// Phase 1: matrix 92 rows 57 cols
[2025-06-04 00:12:13] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:13] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-04 00:12:13] [INFO ] Flow matrix only has 92 transitions (discarded 2 similar events)
[2025-06-04 00:12:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:12:14] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-04 00:12:14] [INFO ] Flow matrix only has 92 transitions (discarded 2 similar events)
[2025-06-04 00:12:14] [INFO ] Invariant cache hit.
[2025-06-04 00:12:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:14] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:14] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:14] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:14] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 91/148 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:15] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 1/149 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 71 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:19] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:20] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:20] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:20] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 91/148 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 93/167 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 1/149 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:25] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 7 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/149 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 0/149 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 169 constraints, problems are : Problem set: 0 solved, 93 unsolved in 11882 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17235ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 17236ms
Starting structural reductions in LTL mode, iteration 1 : 57/101 places, 94/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17404 ms. Remains : 57/101 places, 94/182 transitions.
[2025-06-04 00:12:31] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:12:31] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:12:31] [INFO ] Input system was already deterministic with 94 transitions.
[2025-06-04 00:12:31] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:12:31] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:12:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17438014341463464141.gal : 2 ms
[2025-06-04 00:12:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16403710705820243821.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/CTLFireability17438014341463464141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16403710705820243821.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,110818,0.038932,4780,2,592,5,3402,6,0,317,3432,0
Converting to forward existential form...Done !
original formula: E(EX(EF(((p39==1)&&(((p116==1)||(p110==1))||(p50==1))))) U (!((((((p16==1)&&(p114==1))||(p67==1))||(((p55!=1)&&(((p71==1)&&(p94==1))||(p1...241
=> equivalent forward existential formula: [((FwdU(Init,EX(E(TRUE U ((p39==1)&&(((p116==1)||(p110==1))||(p50==1)))))) * !((((((p16==1)&&(p114==1))||(p67==1...344
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...367
(forward)formula 0,0,1.46148,37696,1,0,416,204324,224,215,2173,198449,458
FORMULA HealthRecord-PT-01-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Graph (trivial) has 141 edges and 101 vertex of which 14 / 101 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 39 place count 55 transition count 103
Iterating global reduction 0 with 38 rules applied. Total rules applied 77 place count 55 transition count 103
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 88 place count 44 transition count 81
Iterating global reduction 0 with 11 rules applied. Total rules applied 99 place count 44 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 104 place count 44 transition count 76
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 41 transition count 67
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 41 transition count 67
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 38 transition count 61
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 38 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 38 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 38 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 36 transition count 51
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 33 transition count 48
Applied a total of 131 rules in 51 ms. Remains 33 /101 variables (removed 68) and now considering 48/182 (removed 134) transitions.
[2025-06-04 00:12:32] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 33 cols
[2025-06-04 00:12:32] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:32] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-04 00:12:32] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2025-06-04 00:12:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:32] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:12:32] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2025-06-04 00:12:32] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2025-06-04 00:12:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 2/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:33] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:33] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:33] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:33] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 5/33 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 39/72 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/73 variables, and 45 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 2/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 5/33 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 39/72 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 34/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/73 variables, and 79 constraints, problems are : Problem set: 0 solved, 34 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2365ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 2365ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/101 places, 48/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2522 ms. Remains : 33/101 places, 48/182 transitions.
[2025-06-04 00:12:35] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:12:35] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:12:35] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 694 steps (67 resets) in 7 ms. (86 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-01-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 00:12:35] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:12:35] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:12:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7015983134221328752.gal : 1 ms
[2025-06-04 00:12:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11710078598553401891.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7015983134221328752.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11710078598553401891.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 63 transition count 111
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 63 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 56 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 56 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 56 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 54 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 54 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 52 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 52 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 52 transition count 83
Applied a total of 102 rules in 13 ms. Remains 52 /101 variables (removed 49) and now considering 83/182 (removed 99) transitions.
[2025-06-04 00:12:35] [INFO ] Flow matrix only has 81 transitions (discarded 2 similar events)
// Phase 1: matrix 81 rows 52 cols
[2025-06-04 00:12:35] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:35] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-04 00:12:35] [INFO ] Flow matrix only has 81 transitions (discarded 2 similar events)
[2025-06-04 00:12:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:12:35] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2025-06-04 00:12:35] [INFO ] Flow matrix only has 81 transitions (discarded 2 similar events)
[2025-06-04 00:12:35] [INFO ] Invariant cache hit.
[2025-06-04 00:12:35] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:36] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:36] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:36] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:36] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:36] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:37] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:37] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 80/132 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/133 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 68 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5188 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:41] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 80/132 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 82/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/133 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 151 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5681 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10881ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 10882ms
Starting structural reductions in LTL mode, iteration 1 : 52/101 places, 83/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11005 ms. Remains : 52/101 places, 83/182 transitions.
[2025-06-04 00:12:46] [INFO ] Flatten gal took : 8 ms
[2025-06-04 00:12:46] [INFO ] Flatten gal took : 8 ms
[2025-06-04 00:12:46] [INFO ] Input system was already deterministic with 83 transitions.
[2025-06-04 00:12:46] [INFO ] Flatten gal took : 8 ms
[2025-06-04 00:12:46] [INFO ] Flatten gal took : 8 ms
[2025-06-04 00:12:46] [INFO ] Time to serialize gal into /tmp/CTLFireability6358529363455668212.gal : 2 ms
[2025-06-04 00:12:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15846536944737840836.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/CTLFireability6358529363455668212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15846536944737840836.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,71127,0.050851,4628,2,653,5,3215,6,0,286,3061,0
Converting to forward existential form...Done !
original formula: AG((((p77==0) + AG((p52==1))) + (AF((p25==1)) + ((p75==1) * (((p7==1) + AX(((((p17==1)&&(p23==1))&&((p28==1)&&(p33==1)))&&(((p38==1)&&(p4...208
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(((p77==0) + !(E(TRUE U !((p52==1))))))) * !(!(EG(!((p25==1)))))) * !((p75==1)))] = FALS...402
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21, t22, t...352
(forward)formula 0,0,1.14465,31496,1,0,306,174711,199,157,1985,145837,354
FORMULA HealthRecord-PT-01-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 62 transition count 110
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 62 transition count 110
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 54 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 54 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 98 place count 54 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 52 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 52 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 50 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 50 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 50 transition count 78
Applied a total of 108 rules in 9 ms. Remains 50 /101 variables (removed 51) and now considering 78/182 (removed 104) transitions.
[2025-06-04 00:12:47] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
// Phase 1: matrix 77 rows 50 cols
[2025-06-04 00:12:47] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-04 00:12:47] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
[2025-06-04 00:12:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:12:47] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2025-06-04 00:12:47] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
[2025-06-04 00:12:47] [INFO ] Invariant cache hit.
[2025-06-04 00:12:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:48] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:48] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:48] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 76/126 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:49] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 62 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4435 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:52] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 76/126 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 77/139 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 140 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5829 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10289ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 10290ms
Starting structural reductions in LTL mode, iteration 1 : 50/101 places, 78/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10415 ms. Remains : 50/101 places, 78/182 transitions.
[2025-06-04 00:12:58] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:12:58] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:12:58] [INFO ] Input system was already deterministic with 78 transitions.
[2025-06-04 00:12:58] [INFO ] Flatten gal took : 7 ms
[2025-06-04 00:12:58] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:12:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16417505898414626028.gal : 1 ms
[2025-06-04 00:12:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3464051184550454921.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/CTLFireability16417505898414626028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3464051184550454921.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,72262,0.030717,4504,2,629,5,2870,6,0,276,2660,0
Converting to forward existential form...Done !
original formula: EG(!(E(EF((((p13==1)&&(p55==1)) + EG((p97==1)))) U (A((p112==1) U (p31==1)) + AG(EX((p68==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E(TRUE U (((p13==1)&&(p55==1)) + EG((p97==1)))) U (!((E(!((p31==1)) U (!((p112==1)) * !((p31==1))...222
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...322
(forward)formula 0,0,1.26287,38216,1,0,348,213830,200,176,1868,203886,405
FORMULA HealthRecord-PT-01-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Graph (trivial) has 131 edges and 101 vertex of which 14 / 101 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 54 transition count 102
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 54 transition count 102
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 89 place count 44 transition count 82
Iterating global reduction 0 with 10 rules applied. Total rules applied 99 place count 44 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 103 place count 44 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 106 place count 41 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 109 place count 41 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 112 place count 38 transition count 63
Iterating global reduction 1 with 3 rules applied. Total rules applied 115 place count 38 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 118 place count 38 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 123 place count 38 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 36 transition count 53
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 33 transition count 50
Applied a total of 130 rules in 24 ms. Remains 33 /101 variables (removed 68) and now considering 50/182 (removed 132) transitions.
[2025-06-04 00:12:59] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
// Phase 1: matrix 43 rows 33 cols
[2025-06-04 00:12:59] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-04 00:12:59] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
[2025-06-04 00:12:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:12:59] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:12:59] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2025-06-04 00:12:59] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
[2025-06-04 00:12:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 7/33 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:59] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:59] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:12:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 42/75 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/76 variables, and 43 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 7/33 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 42/75 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 36/79 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/76 variables, and 79 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2458ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2459ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/101 places, 50/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2615 ms. Remains : 33/101 places, 50/182 transitions.
[2025-06-04 00:13:01] [INFO ] Flatten gal took : 7 ms
[2025-06-04 00:13:01] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:13:02] [INFO ] Input system was already deterministic with 50 transitions.
RANDOM walk for 1393 steps (135 resets) in 13 ms. (99 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-01-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 00:13:02] [INFO ] Flatten gal took : 2 ms
[2025-06-04 00:13:02] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:13:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13859216554914399568.gal : 0 ms
[2025-06-04 00:13:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10559546572854246629.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13859216554914399568.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10559546572854246629.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 58 transition count 102
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 58 transition count 102
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 48 transition count 82
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 48 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 110 place count 48 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 45 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 45 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 42 transition count 63
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 42 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 125 place count 42 transition count 60
Applied a total of 125 rules in 9 ms. Remains 42 /101 variables (removed 59) and now considering 60/182 (removed 122) transitions.
[2025-06-04 00:13:02] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
// Phase 1: matrix 59 rows 42 cols
[2025-06-04 00:13:02] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-04 00:13:02] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2025-06-04 00:13:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:13:02] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-04 00:13:02] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2025-06-04 00:13:02] [INFO ] Invariant cache hit.
[2025-06-04 00:13:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:02] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:02] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:02] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/100 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 53 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:04] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:04] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:04] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 58/100 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 59/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/101 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 115 constraints, problems are : Problem set: 0 solved, 59 unsolved in 4597 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6859ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 6859ms
Starting structural reductions in LTL mode, iteration 1 : 42/101 places, 60/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6992 ms. Remains : 42/101 places, 60/182 transitions.
[2025-06-04 00:13:09] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:13:09] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:13:09] [INFO ] Input system was already deterministic with 60 transitions.
[2025-06-04 00:13:09] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:13:09] [INFO ] Flatten gal took : 9 ms
[2025-06-04 00:13:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15178379591165631026.gal : 0 ms
[2025-06-04 00:13:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15552120690013740005.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/CTLFireability15178379591165631026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15552120690013740005.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,35001,0.017325,4140,2,362,5,1677,6,0,226,1447,0
Converting to forward existential form...Done !
original formula: AG(EX(E(((p16==1)&&(p114==1)) U (p43!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(((p16==1)&&(p114==1)) U (p43!=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t21, t22, t23, t24, t40, t...257
(forward)formula 0,0,0.071691,6060,1,0,116,10539,138,58,1416,9230,134
FORMULA HealthRecord-PT-01-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Graph (trivial) has 139 edges and 101 vertex of which 14 / 101 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 39 place count 55 transition count 104
Iterating global reduction 0 with 38 rules applied. Total rules applied 77 place count 55 transition count 104
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 88 place count 44 transition count 82
Iterating global reduction 0 with 11 rules applied. Total rules applied 99 place count 44 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 104 place count 44 transition count 77
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 41 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 41 transition count 68
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 39 transition count 64
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 39 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 116 place count 39 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 39 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 37 transition count 55
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 34 transition count 52
Applied a total of 128 rules in 15 ms. Remains 34 /101 variables (removed 67) and now considering 52/182 (removed 130) transitions.
[2025-06-04 00:13:09] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
// Phase 1: matrix 45 rows 34 cols
[2025-06-04 00:13:09] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:09] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-04 00:13:09] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2025-06-04 00:13:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:09] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:13:09] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2025-06-04 00:13:09] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2025-06-04 00:13:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:09] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 44/78 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/79 variables, and 43 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 44/78 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 38/81 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/79 variables, and 81 constraints, problems are : Problem set: 0 solved, 38 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2195ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2195ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/101 places, 52/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2325 ms. Remains : 34/101 places, 52/182 transitions.
[2025-06-04 00:13:11] [INFO ] Flatten gal took : 2 ms
[2025-06-04 00:13:11] [INFO ] Flatten gal took : 2 ms
[2025-06-04 00:13:11] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-04 00:13:11] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:13:11] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:13:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2304259173706279639.gal : 1 ms
[2025-06-04 00:13:11] [INFO ] Time to serialize properties into /tmp/CTLFireability16122754361517267682.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/CTLFireability2304259173706279639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16122754361517267682.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,7492,0.027895,4176,2,262,5,1536,6,0,176,1589,0
Converting to forward existential form...Done !
original formula: EF(AG(((p14==0)&&(p94==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p14==0)&&(p94==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t23, t24, t25, t26, Interse...245
(forward)formula 0,1,0.107801,5712,1,0,109,10699,118,50,1170,8279,114
FORMULA HealthRecord-PT-01-CTLFireability-2025-09 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 : 101/101 places, 182/182 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 63 transition count 112
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 63 transition count 112
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 55 transition count 96
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 55 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 55 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 53 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 53 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 51 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 51 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 51 transition count 82
Applied a total of 104 rules in 5 ms. Remains 51 /101 variables (removed 50) and now considering 82/182 (removed 100) transitions.
[2025-06-04 00:13:11] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
// Phase 1: matrix 81 rows 51 cols
[2025-06-04 00:13:11] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-04 00:13:11] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2025-06-04 00:13:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:13:11] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2025-06-04 00:13:11] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2025-06-04 00:13:11] [INFO ] Invariant cache hit.
[2025-06-04 00:13:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:12] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:12] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:12] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 80/131 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 63 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3978 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:16] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:16] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 80/131 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 81/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 146 constraints, problems are : Problem set: 0 solved, 81 unsolved in 6548 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10534ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 10534ms
Starting structural reductions in LTL mode, iteration 1 : 51/101 places, 82/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10673 ms. Remains : 51/101 places, 82/182 transitions.
[2025-06-04 00:13:22] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:13:22] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:13:22] [INFO ] Input system was already deterministic with 82 transitions.
[2025-06-04 00:13:22] [INFO ] Flatten gal took : 7 ms
[2025-06-04 00:13:22] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:13:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17902984329128104406.gal : 2 ms
[2025-06-04 00:13:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10630662183393762156.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/CTLFireability17902984329128104406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10630662183393762156.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,106713,0.030339,4588,2,531,5,2872,6,0,284,2675,0
Converting to forward existential form...Done !
original formula: AG(((EG(((p48==0) * (AF((p79==0)) + EG((p36==0))))) + (p6==1)) + AX(EG(((p11==1)&&(p31==1))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((EG(((p48==0) * (!(EG(!((p79==0)))) + EG((p36==0))))) + (p6==1))))) * !(EG(((p11==1)&&...176
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...317
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.52623,48900,1,0,465,278499,203,247,1894,271172,503
FORMULA HealthRecord-PT-01-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 64 transition count 114
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 64 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 58 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 58 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 58 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 56 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 56 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 54 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 54 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 54 transition count 89
Applied a total of 97 rules in 3 ms. Remains 54 /101 variables (removed 47) and now considering 89/182 (removed 93) transitions.
[2025-06-04 00:13:23] [INFO ] Flow matrix only has 88 transitions (discarded 1 similar events)
// Phase 1: matrix 88 rows 54 cols
[2025-06-04 00:13:23] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:23] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-04 00:13:23] [INFO ] Flow matrix only has 88 transitions (discarded 1 similar events)
[2025-06-04 00:13:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:13:24] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-04 00:13:24] [INFO ] Flow matrix only has 88 transitions (discarded 1 similar events)
[2025-06-04 00:13:24] [INFO ] Invariant cache hit.
[2025-06-04 00:13:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:24] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:24] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:25] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:25] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:25] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 87/141 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:26] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 68 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5547 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:30] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:30] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:30] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:30] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 87/141 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 88/159 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/142 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 160 constraints, problems are : Problem set: 0 solved, 88 unsolved in 9602 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15159ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 15160ms
Starting structural reductions in LTL mode, iteration 1 : 54/101 places, 89/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15296 ms. Remains : 54/101 places, 89/182 transitions.
[2025-06-04 00:13:39] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:13:39] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:13:39] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-04 00:13:39] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:13:39] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:13:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8258844280478379749.gal : 2 ms
[2025-06-04 00:13:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17594888366680546736.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/CTLFireability8258844280478379749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17594888366680546736.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,77284,0.038234,4856,2,901,5,4153,6,0,303,3759,0
Converting to forward existential form...Done !
original formula: (AG(((((EG(AX(((p71==0)||(p102==0)))) * (EF((p16==1)) + (p51==0))) + (E(((p71==1)&&(p102==1)) U (p16==1)) * EG((p5==0)))) + ((p101==0)||(...280
=> equivalent forward existential formula: (([((((FwdU(Init,TRUE) * !(((p71==1)&&(p86==1)))) * !(((p101==0)||(p50==1)))) * !((E(((p71==1)&&(p102==1)) U (p1...547
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...362
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.0923,66088,1,0,495,372995,233,290,2138,364771,559
FORMULA HealthRecord-PT-01-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Graph (trivial) has 110 edges and 101 vertex of which 12 / 101 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 64 transition count 118
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 64 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 69 place count 58 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 75 place count 58 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 77 place count 58 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 58 transition count 100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 89 place count 54 transition count 96
Applied a total of 89 rules in 15 ms. Remains 54 /101 variables (removed 47) and now considering 96/182 (removed 86) transitions.
[2025-06-04 00:13:41] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
// Phase 1: matrix 88 rows 54 cols
[2025-06-04 00:13:41] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:41] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-04 00:13:41] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2025-06-04 00:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:13:41] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:13:41] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2025-06-04 00:13:41] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2025-06-04 00:13:41] [INFO ] Invariant cache hit.
[2025-06-04 00:13:41] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:42] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:42] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 87/141 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 67 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5405 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 87/141 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 95/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 162 constraints, problems are : Problem set: 0 solved, 95 unsolved in 8256 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13677ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 13678ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/101 places, 96/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13866 ms. Remains : 54/101 places, 96/182 transitions.
[2025-06-04 00:13:55] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:13:55] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:13:55] [INFO ] Input system was already deterministic with 96 transitions.
[2025-06-04 00:13:55] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:13:55] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:13:55] [INFO ] Time to serialize gal into /tmp/CTLFireability5878930367662909241.gal : 1 ms
[2025-06-04 00:13:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17224687412253587686.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/CTLFireability5878930367662909241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17224687412253587686.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,25133,0.034471,4660,2,499,5,2955,6,0,299,2748,0
Converting to forward existential form...Done !
original formula: E(EF((((p109==1)&&(p27==1)) * ((((p95==1)||(p5==1)) + (AF((p93==1)) * EF((p87==1)))) * ((EF(((p71==1)&&(p92==1))) + (p73==1)) + (p20==1))...222
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,E(TRUE U (((p109==1)&&(p27==1)) * ((((p95==1)||(p5==1)) + (!(EG(!((p93==1)))) * E(TRUE U (p...291
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...395
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.06081,29520,1,0,409,177745,245,199,2198,125376,452
FORMULA HealthRecord-PT-01-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 61 transition count 108
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 61 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 54 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 54 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 96 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 53 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 53 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 52 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 52 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 52 transition count 86
Applied a total of 101 rules in 3 ms. Remains 52 /101 variables (removed 49) and now considering 86/182 (removed 96) transitions.
[2025-06-04 00:13:56] [INFO ] Flow matrix only has 85 transitions (discarded 1 similar events)
// Phase 1: matrix 85 rows 52 cols
[2025-06-04 00:13:56] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:56] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 00:13:56] [INFO ] Flow matrix only has 85 transitions (discarded 1 similar events)
[2025-06-04 00:13:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:13:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:13:56] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-04 00:13:56] [INFO ] Flow matrix only has 85 transitions (discarded 1 similar events)
[2025-06-04 00:13:56] [INFO ] Invariant cache hit.
[2025-06-04 00:13:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:57] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:57] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:57] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 84/136 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:13:58] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 64 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5392 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:14:02] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 84/136 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 85/149 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/137 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 150 constraints, problems are : Problem set: 0 solved, 85 unsolved in 8323 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13727ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 13727ms
Starting structural reductions in LTL mode, iteration 1 : 52/101 places, 86/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13894 ms. Remains : 52/101 places, 86/182 transitions.
[2025-06-04 00:14:10] [INFO ] Flatten gal took : 11 ms
[2025-06-04 00:14:10] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:14:10] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-04 00:14:10] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:14:10] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:14:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1248218402916832058.gal : 1 ms
[2025-06-04 00:14:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8066611712973539710.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/CTLFireability1248218402916832058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8066611712973539710.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,63189,0.033672,4496,2,497,5,2396,6,0,292,2069,0
Converting to forward existential form...Done !
original formula: AX(AG(((p95==0) + (E((p52==1) U (p2==1)) * EG((p79==1))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * !((p95==0))) * !(E((p52==1) U (p2==1))))] = FALSE * [((FwdU(EY(Init),TRUE) * !((p95==0...187
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...332
(forward)formula 0,0,0.15426,7568,1,0,177,16146,195,86,2013,12417,205
FORMULA HealthRecord-PT-01-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 182/182 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 63 transition count 111
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 63 transition count 111
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 55 transition count 95
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 55 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 95 place count 55 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 54 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 54 transition count 89
Applied a total of 97 rules in 3 ms. Remains 54 /101 variables (removed 47) and now considering 89/182 (removed 93) transitions.
[2025-06-04 00:14:10] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
// Phase 1: matrix 87 rows 54 cols
[2025-06-04 00:14:10] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:14:10] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-04 00:14:10] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
[2025-06-04 00:14:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:14:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:14:10] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-04 00:14:10] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
[2025-06-04 00:14:10] [INFO ] Invariant cache hit.
[2025-06-04 00:14:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:14:11] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:14:11] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:14:11] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:14:12] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 86/140 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/141 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 67 constraints, problems are : Problem set: 0 solved, 88 unsolved in 6304 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:14:17] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:14:17] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 86/140 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 88/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/141 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 157 constraints, problems are : Problem set: 0 solved, 88 unsolved in 11108 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17427ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 17427ms
Starting structural reductions in LTL mode, iteration 1 : 54/101 places, 89/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17596 ms. Remains : 54/101 places, 89/182 transitions.
[2025-06-04 00:14:27] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:14:27] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:14:28] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-04 00:14:28] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:14:28] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:14:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13274163910405641144.gal : 1 ms
[2025-06-04 00:14:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3129395795556692751.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/CTLFireability13274163910405641144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3129395795556692751.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,94618,0.046391,4480,2,462,5,2398,6,0,301,2018,0
Converting to forward existential form...Done !
original formula: EG(((A(AG((p47==1)) U EX(((p9==1)||(p106==1)))) + (p93==1)) + ((AG((p31==0)) * ((!(A(((p71==1)&&(p96==1)) U (p75==1))) + (p16==0)) + (p11...238
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(EX(((p9==1)||(p106==1)))) U (!(!(E(TRUE U !((p47==1))))) * !(EX(((p9==1)||(p106==1)))))) + E...427
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...313
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.1038,32564,1,0,416,180647,226,246,2139,163350,480
FORMULA HealthRecord-PT-01-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 00:14:29] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:14:29] [INFO ] Flatten gal took : 5 ms
Total runtime 220875 ms.
BK_STOP 1748996069248
--------------------
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="HealthRecord-PT-01"
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 HealthRecord-PT-01, 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-174867008100538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-01.tgz
mv HealthRecord-PT-01 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 ;