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 | 144176.00 | 0.00 | 0.00 | FFFFFTFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008100540.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008100540
=====================================================================
--------------------
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-LTLFireability-00
FORMULA_NAME HealthRecord-PT-01-LTLFireability-01
FORMULA_NAME HealthRecord-PT-01-LTLFireability-02
FORMULA_NAME HealthRecord-PT-01-LTLFireability-03
FORMULA_NAME HealthRecord-PT-01-LTLFireability-04
FORMULA_NAME HealthRecord-PT-01-LTLFireability-05
FORMULA_NAME HealthRecord-PT-01-LTLFireability-06
FORMULA_NAME HealthRecord-PT-01-LTLFireability-07
FORMULA_NAME HealthRecord-PT-01-LTLFireability-08
FORMULA_NAME HealthRecord-PT-01-LTLFireability-09
FORMULA_NAME HealthRecord-PT-01-LTLFireability-10
FORMULA_NAME HealthRecord-PT-01-LTLFireability-11
FORMULA_NAME HealthRecord-PT-01-LTLFireability-12
FORMULA_NAME HealthRecord-PT-01-LTLFireability-13
FORMULA_NAME HealthRecord-PT-01-LTLFireability-14
FORMULA_NAME HealthRecord-PT-01-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748996215999
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-06-04 00:16:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 00:16:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 00:16:58] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2025-06-04 00:16:58] [INFO ] Transformed 117 places.
[2025-06-04 00:16:58] [INFO ] Transformed 218 transitions.
[2025-06-04 00:16:58] [INFO ] Found NUPN structural information;
[2025-06-04 00:16:58] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
FORMULA HealthRecord-PT-01-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 213/213 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 70 transition count 125
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 70 transition count 125
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 67 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 67 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 66 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 66 transition count 116
Applied a total of 102 rules in 47 ms. Remains 66 /117 variables (removed 51) and now considering 116/213 (removed 97) transitions.
[2025-06-04 00:16:59] [INFO ] Flow matrix only has 114 transitions (discarded 2 similar events)
// Phase 1: matrix 114 rows 66 cols
[2025-06-04 00:16:59] [INFO ] Computed 8 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:16:59] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-06-04 00:16:59] [INFO ] Flow matrix only has 114 transitions (discarded 2 similar events)
[2025-06-04 00:16:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:16:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:16:59] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-06-04 00:17:00] [INFO ] Flow matrix only has 114 transitions (discarded 2 similar events)
[2025-06-04 00:17:00] [INFO ] Invariant cache hit.
[2025-06-04 00:17:00] [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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:02] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:02] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:02] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:02] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:02] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:03] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 113/179 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:05] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/180 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:09] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 6 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/180 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:10] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 14 (OVERLAPS) 0/180 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 84 constraints, problems are : Problem set: 0 solved, 115 unsolved in 13829 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:15] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:15] [INFO ] Deduced a trap composed of 21 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:17:15] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 113/179 variables, 66/86 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 115/201 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/180 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/180 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 202 constraints, problems are : Problem set: 0 solved, 115 unsolved in 17976 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31969ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 31998ms
Starting structural reductions in LTL mode, iteration 1 : 66/117 places, 116/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32776 ms. Remains : 66/117 places, 116/213 transitions.
Support contains 25 out of 66 places after structural reductions.
[2025-06-04 00:17:32] [INFO ] Flatten gal took : 64 ms
[2025-06-04 00:17:32] [INFO ] Flatten gal took : 27 ms
[2025-06-04 00:17:32] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (2068 resets) in 1988 ms. (20 steps per ms) remains 6/24 properties
BEST_FIRST walk for 40002 steps (336 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (341 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (311 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (325 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (323 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (329 resets) in 85 ms. (465 steps per ms) remains 5/6 properties
[2025-06-04 00:17:33] [INFO ] Flow matrix only has 114 transitions (discarded 2 similar events)
[2025-06-04 00:17:33] [INFO ] Invariant cache hit.
[2025-06-04 00:17:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp14 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/43 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:33] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 23/66 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:33] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:33] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/179 variables, 66/77 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/180 variables, 1/78 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/180 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 78 constraints, problems are : Problem set: 1 solved, 4 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 24/66 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:34] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 113/179 variables, 66/78 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 4/82 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:34] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 1/83 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/180 variables, 1/84 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/180 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 84 constraints, problems are : Problem set: 1 solved, 4 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1174ms problems are : Problem set: 1 solved, 4 unsolved
Finished Parikh walk after 2291 steps, including 124 resets, run visited all 2 properties in 12 ms. (steps per millisecond=190 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 67 ms.
FORMULA HealthRecord-PT-01-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 3 stabilizing places and 4 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Graph (trivial) has 73 edges and 66 vertex of which 12 / 66 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 44 transition count 80
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 44 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 33 place count 44 transition count 78
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 39 transition count 67
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 39 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 45 place count 39 transition count 65
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 37 transition count 60
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 37 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 37 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 36 transition count 57
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 36 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 36 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 35 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 35 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 58 place count 34 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 34 transition count 58
Applied a total of 59 rules in 72 ms. Remains 34 /66 variables (removed 32) and now considering 58/116 (removed 58) transitions.
[2025-06-04 00:17:35] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 34 cols
[2025-06-04 00:17:35] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:17:35] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 00:17:35] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-04 00:17:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:17:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 00:17:35] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:17:35] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-04 00:17:35] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-04 00:17:35] [INFO ] Invariant cache hit.
[2025-06-04 00:17:35] [INFO ] State equation strengthened by 6 read => feed constraints.
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, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:35] [INFO ] Deduced a trap composed of 13 places in 54 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, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 51/85 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 49 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 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, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:37] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:37] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 51/85 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 44/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/85 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/86 variables, and 95 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2346 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4082ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 4084ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/66 places, 58/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4323 ms. Remains : 34/66 places, 58/116 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-00
Product exploration explored 100000 steps with 2 reset in 382 ms.
Product exploration explored 100000 steps with 8 reset in 162 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3472 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (574 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3867 steps, run visited all 1 properties in 16 ms. (steps per millisecond=241 )
Probabilistic random walk after 3867 steps, saw 819 distinct states, run finished after 21 ms. (steps per millisecond=184 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2025-06-04 00:17:41] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-04 00:17:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:17:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-04 00:17:41] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-04 00:17:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:17:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 00:17:41] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:17:41] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-04 00:17:41] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-04 00:17:41] [INFO ] Invariant cache hit.
[2025-06-04 00:17:41] [INFO ] State equation strengthened by 6 read => feed constraints.
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, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:41] [INFO ] Deduced a trap composed of 4 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:17:41] [INFO ] Deduced a trap composed of 13 places in 37 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, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 51/85 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 49 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1487 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 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, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:42] [INFO ] Deduced a trap composed of 6 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:17:43] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 51/85 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 44/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/85 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/86 variables, and 95 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2329 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3830ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3832ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3934 ms. Remains : 34/34 places, 58/58 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 31139 steps (2704 resets) in 99 ms. (311 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10 reset in 152 ms.
Product exploration explored 100000 steps with 13 reset in 186 ms.
Built C files in :
/tmp/ltsmin2497208868772827188
[2025-06-04 00:17:46] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2025-06-04 00:17:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:17:46] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2025-06-04 00:17:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:17:46] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2025-06-04 00:17:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:17:46] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2497208868772827188
Running compilation step : cd /tmp/ltsmin2497208868772827188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 598 ms.
Running link step : cd /tmp/ltsmin2497208868772827188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin2497208868772827188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12978421891196882802.hoa' '--buchi-type=spotba'
LTSmin run took 221 ms.
FORMULA HealthRecord-PT-01-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-01-LTLFireability-00 finished in 11972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F((G(p0)&&F(p1))) U X(X(p2)))&&F(p3)))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 53 transition count 91
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 53 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 53 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 49 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 49 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 49 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 48 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 48 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 47 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 47 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 47 transition count 74
Applied a total of 42 rules in 13 ms. Remains 47 /66 variables (removed 19) and now considering 74/116 (removed 42) transitions.
[2025-06-04 00:17:47] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
// Phase 1: matrix 73 rows 47 cols
[2025-06-04 00:17:47] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:17:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 00:17:47] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2025-06-04 00:17:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:17:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:17:47] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-04 00:17:47] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2025-06-04 00:17:47] [INFO ] Invariant cache hit.
[2025-06-04 00:17: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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:48] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:48] [INFO ] Deduced a trap composed of 15 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:17:48] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 72/119 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 58 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3958 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:51] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:51] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 72/119 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 73/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:17:53] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/120 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 134 constraints, problems are : Problem set: 0 solved, 73 unsolved in 7861 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11843ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 11844ms
Starting structural reductions in LTL mode, iteration 1 : 47/66 places, 74/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12040 ms. Remains : 47/66 places, 74/116 transitions.
Stuttering acceptance computed with spot in 966 ms :[(OR (NOT p3) (NOT p2)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-01
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-01-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLFireability-01 finished in 13078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U X(X((p0 U X(p0))))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 50 transition count 85
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 50 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 50 transition count 82
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 45 transition count 71
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 45 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 45 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 43 transition count 64
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 43 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 43 transition count 63
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 42 transition count 61
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 42 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 42 transition count 60
Applied a total of 55 rules in 11 ms. Remains 42 /66 variables (removed 24) and now considering 60/116 (removed 56) transitions.
[2025-06-04 00:18:00] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
// Phase 1: matrix 59 rows 42 cols
[2025-06-04 00:18:00] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:00] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-04 00:18:00] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2025-06-04 00:18:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:18:00] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-04 00:18:00] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2025-06-04 00:18:00] [INFO ] Invariant cache hit.
[2025-06-04 00:18:00] [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:18:00] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:01] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/100 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/52 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:18:02] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (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 3300 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:18:04] [INFO ] Deduced a trap composed of 11 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:18:04] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 58/100 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 59/113 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/101 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 114 constraints, problems are : Problem set: 0 solved, 59 unsolved in 4757 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: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8070ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 8071ms
Starting structural reductions in LTL mode, iteration 1 : 42/66 places, 60/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8240 ms. Remains : 42/66 places, 60/116 transitions.
Stuttering acceptance computed with spot in 894 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLFireability-03 finished in 9171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!F(G(p0))&&(X(X(X(p0)))||p1))) U p0)))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 50 transition count 85
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 50 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 50 transition count 82
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 45 transition count 71
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 45 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 45 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 43 transition count 64
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 43 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 43 transition count 63
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 42 transition count 61
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 42 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 42 transition count 60
Applied a total of 55 rules in 17 ms. Remains 42 /66 variables (removed 24) and now considering 60/116 (removed 56) transitions.
[2025-06-04 00:18:09] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
// Phase 1: matrix 59 rows 42 cols
[2025-06-04 00:18: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:18:09] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-04 00:18:09] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2025-06-04 00:18:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:18:09] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-04 00:18:09] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2025-06-04 00:18:09] [INFO ] Invariant cache hit.
[2025-06-04 00:18:09] [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:18:10] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:10] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:10] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 4 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 2784 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:18:12] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:12] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:12] [INFO ] Deduced a trap composed of 12 places in 62 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 5240 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 8043ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 8044ms
Starting structural reductions in LTL mode, iteration 1 : 42/66 places, 60/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8228 ms. Remains : 42/66 places, 60/116 transitions.
Stuttering acceptance computed with spot in 434 ms :[(NOT p0), (NOT p0), true, p0, p0, (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-04
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLFireability-04 finished in 8709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Graph (trivial) has 79 edges and 66 vertex of which 14 / 66 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 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 43 transition count 78
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 43 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 34 place count 43 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 38 transition count 64
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 38 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 46 place count 38 transition count 62
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 36 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 36 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 36 transition count 56
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 35 transition count 54
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 35 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 35 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 34 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 34 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 59 place count 33 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 61 place count 33 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 62 place count 32 transition count 52
Applied a total of 62 rules in 42 ms. Remains 32 /66 variables (removed 34) and now considering 52/116 (removed 64) transitions.
[2025-06-04 00:18:18] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
// Phase 1: matrix 44 rows 32 cols
[2025-06-04 00:18:18] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-04 00:18:18] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
[2025-06-04 00:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-04 00:18:18] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:18:18] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2025-06-04 00:18:18] [INFO ] Flow matrix only has 44 transitions (discarded 8 similar events)
[2025-06-04 00:18:18] [INFO ] Invariant cache hit.
[2025-06-04 00:18:18] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 2/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/3 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:18:18] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:18] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 2/5 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:18:18] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 5/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 43/75 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/75 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/76 variables, and 48 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 2/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 5/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 43/75 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 38/86 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/75 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/76 variables, and 86 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 32/32 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3507ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 3508ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/66 places, 52/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3729 ms. Remains : 32/66 places, 52/116 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLFireability-06 finished in 3805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((F(p0)&&X(p1)&&F(p2))))))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 50 transition count 85
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 50 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 50 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 46 transition count 73
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 46 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 46 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 45 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 45 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 45 transition count 68
Applied a total of 48 rules in 9 ms. Remains 45 /66 variables (removed 21) and now considering 68/116 (removed 48) transitions.
[2025-06-04 00:18:21] [INFO ] Flow matrix only has 67 transitions (discarded 1 similar events)
// Phase 1: matrix 67 rows 45 cols
[2025-06-04 00:18:21] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:21] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-04 00:18:21] [INFO ] Flow matrix only has 67 transitions (discarded 1 similar events)
[2025-06-04 00:18:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:18:22] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2025-06-04 00:18:22] [INFO ] Flow matrix only has 67 transitions (discarded 1 similar events)
[2025-06-04 00:18:22] [INFO ] Invariant cache hit.
[2025-06-04 00:18:22] [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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:22] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:22] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 66/111 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 1/112 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 55 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3805 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:26] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:26] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:26] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 66/111 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 67/124 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 125 constraints, problems are : Problem set: 0 solved, 67 unsolved in 6020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9842ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 9844ms
Starting structural reductions in LTL mode, iteration 1 : 45/66 places, 68/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10015 ms. Remains : 45/66 places, 68/116 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-07
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLFireability-07 finished in 10387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Graph (trivial) has 74 edges and 66 vertex of which 14 / 66 are part of one of the 7 SCC in 0 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 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 45 transition count 83
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 45 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 29 place count 45 transition count 81
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 41 transition count 72
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 41 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 41 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 39 transition count 66
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 39 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 39 transition count 65
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 38 transition count 63
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 38 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 38 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 37 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 49 place count 37 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 51 place count 36 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 53 place count 36 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 35 transition count 63
Applied a total of 54 rules in 23 ms. Remains 35 /66 variables (removed 31) and now considering 63/116 (removed 53) transitions.
[2025-06-04 00:18:32] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
// Phase 1: matrix 56 rows 35 cols
[2025-06-04 00:18:32] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:32] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-04 00:18:32] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2025-06-04 00:18:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 00:18:32] [INFO ] Implicit Places using invariants and state equation in 61 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:18:32] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2025-06-04 00:18:32] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2025-06-04 00:18:32] [INFO ] Invariant cache hit.
[2025-06-04 00:18:32] [INFO ] State equation strengthened by 7 read => feed constraints.
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, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:32] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:32] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:32] [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:18:33] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 55/90 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/91 variables, and 53 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 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, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:34] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:34] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:35] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 55/90 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 49/105 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/90 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/91 variables, and 105 constraints, problems are : Problem set: 0 solved, 49 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5111ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 5112ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/66 places, 63/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5240 ms. Remains : 35/66 places, 63/116 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 199 ms.
Product exploration explored 100000 steps with 14 reset in 247 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 3801 steps (401 resets) in 28 ms. (131 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-06-04 00:18:38] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2025-06-04 00:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-04 00:18:38] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2025-06-04 00:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:38] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 00:18:38] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:18:38] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2025-06-04 00:18:38] [INFO ] Flow matrix only has 56 transitions (discarded 7 similar events)
[2025-06-04 00:18:38] [INFO ] Invariant cache hit.
[2025-06-04 00:18:38] [INFO ] State equation strengthened by 7 read => feed constraints.
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, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:39] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:39] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:39] [INFO ] Deduced a trap composed of 15 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:18:39] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 55/90 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/91 variables, and 53 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2000 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 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, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:40] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:41] [INFO ] Deduced a trap composed of 14 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:18:41] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 55/90 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 49/105 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/90 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/91 variables, and 105 constraints, problems are : Problem set: 0 solved, 49 unsolved in 3122 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5135ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 5135ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5296 ms. Remains : 35/35 places, 63/63 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 4894 steps (510 resets) in 21 ms. (222 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5 reset in 196 ms.
Product exploration explored 100000 steps with 4 reset in 201 ms.
Built C files in :
/tmp/ltsmin12955451817684245349
[2025-06-04 00:18:44] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2025-06-04 00:18:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:18:44] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2025-06-04 00:18:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:18:44] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2025-06-04 00:18:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:18:44] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12955451817684245349
Running compilation step : cd /tmp/ltsmin12955451817684245349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 324 ms.
Running link step : cd /tmp/ltsmin12955451817684245349;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12955451817684245349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased540742760410758264.hoa' '--buchi-type=spotba'
LTSmin run took 128 ms.
FORMULA HealthRecord-PT-01-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-01-LTLFireability-08 finished in 12876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||X(p1)))&&F(p2))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 51 transition count 87
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 51 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 51 transition count 84
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 47 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 47 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 47 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 46 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 46 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 46 transition count 70
Applied a total of 46 rules in 8 ms. Remains 46 /66 variables (removed 20) and now considering 70/116 (removed 46) transitions.
[2025-06-04 00:18:45] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
// Phase 1: matrix 69 rows 46 cols
[2025-06-04 00:18:45] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:45] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-04 00:18:45] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
[2025-06-04 00:18:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:18:45] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2025-06-04 00:18:45] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
[2025-06-04 00:18:45] [INFO ] Invariant cache hit.
[2025-06-04 00:18:45] [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/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:46] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:46] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:46] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 68/114 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 1/115 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/115 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 57 constraints, problems are : Problem set: 0 solved, 69 unsolved in 4248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:50] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:50] [INFO ] Deduced a trap composed of 12 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:18:50] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 68/114 variables, 46/59 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 69/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 129 constraints, problems are : Problem set: 0 solved, 69 unsolved in 6572 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10835ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 10835ms
Starting structural reductions in LTL mode, iteration 1 : 46/66 places, 70/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11025 ms. Remains : 46/66 places, 70/116 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-10
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-01-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLFireability-10 finished in 11261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 51 transition count 87
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 51 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 51 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 48 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 48 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 48 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 46 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 46 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 46 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 45 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 45 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 45 transition count 67
Applied a total of 48 rules in 6 ms. Remains 45 /66 variables (removed 21) and now considering 67/116 (removed 49) transitions.
[2025-06-04 00:18:56] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
// Phase 1: matrix 66 rows 45 cols
[2025-06-04 00:18:56] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:56] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-04 00:18:56] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
[2025-06-04 00:18:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:18:56] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2025-06-04 00:18:56] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
[2025-06-04 00:18:56] [INFO ] Invariant cache hit.
[2025-06-04 00:18: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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:18:57] [INFO ] Deduced a trap composed of 17 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:18:57] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 65/110 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 55 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3337 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:00] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:00] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 65/110 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 66/122 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/111 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 123 constraints, problems are : Problem set: 0 solved, 66 unsolved in 6585 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9939ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 9939ms
Starting structural reductions in LTL mode, iteration 1 : 45/66 places, 67/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10110 ms. Remains : 45/66 places, 67/116 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLFireability-12 finished in 10239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Graph (trivial) has 78 edges and 66 vertex of which 14 / 66 are part of one of the 7 SCC in 0 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 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 43 transition count 79
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 43 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 34 place count 43 transition count 76
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 38 transition count 65
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 38 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 38 transition count 64
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 36 transition count 59
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 36 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 36 transition count 58
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 35 transition count 56
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 35 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 35 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 34 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 34 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 58 place count 33 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 60 place count 33 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 32 transition count 54
Applied a total of 61 rules in 16 ms. Remains 32 /66 variables (removed 34) and now considering 54/116 (removed 62) transitions.
[2025-06-04 00:19:06] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 32 cols
[2025-06-04 00:19:06] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:19:06] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-04 00:19:06] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
[2025-06-04 00:19:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:19:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-04 00:19:06] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:19:06] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-04 00:19:06] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
[2025-06-04 00:19:06] [INFO ] Invariant cache hit.
[2025-06-04 00:19:06] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 7/32 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:07] [INFO ] Deduced a trap composed of 4 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:19:07] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 46/78 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/79 variables, and 46 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1519 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 7/32 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:08] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:08] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 46/78 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 40/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/79 variables, and 88 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2265 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3790ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3790ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/66 places, 54/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3907 ms. Remains : 32/66 places, 54/116 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 162 ms.
Product exploration explored 100000 steps with 8 reset in 477 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 15756 steps (1660 resets) in 43 ms. (358 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2025-06-04 00:19:11] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
[2025-06-04 00:19:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:19:11] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-04 00:19:11] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
[2025-06-04 00:19:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:19:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-04 00:19:11] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:19:11] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-04 00:19:11] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
[2025-06-04 00:19:11] [INFO ] Invariant cache hit.
[2025-06-04 00:19:11] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 7/32 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:12] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 46/78 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/79 variables, and 46 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1503 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 7/32 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:13] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:13] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 46/78 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 40/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/79 variables, and 88 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2227 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3741ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3741ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3889 ms. Remains : 32/32 places, 54/54 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 8473 steps (890 resets) in 29 ms. (282 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 66 ms.
Product exploration explored 100000 steps with 0 reset in 474 ms.
Built C files in :
/tmp/ltsmin11822767106414249587
[2025-06-04 00:19:16] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2025-06-04 00:19:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:19:16] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2025-06-04 00:19:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:19:16] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2025-06-04 00:19:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:19:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11822767106414249587
Running compilation step : cd /tmp/ltsmin11822767106414249587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 293 ms.
Running link step : cd /tmp/ltsmin11822767106414249587;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin11822767106414249587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12008352770191102787.hoa' '--buchi-type=spotba'
LTSmin run took 86 ms.
FORMULA HealthRecord-PT-01-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-01-LTLFireability-14 finished in 10419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 116/116 transitions.
Graph (trivial) has 63 edges and 66 vertex of which 14 / 66 are part of one of the 7 SCC in 0 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 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 42 transition count 77
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 42 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 36 place count 42 transition count 74
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 37 transition count 63
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 37 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 37 transition count 61
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 35 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 35 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 35 transition count 55
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 34 transition count 53
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 34 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 34 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 33 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 33 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 61 place count 33 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 62 place count 32 transition count 47
Applied a total of 62 rules in 21 ms. Remains 32 /66 variables (removed 34) and now considering 47/116 (removed 69) transitions.
[2025-06-04 00:19:17] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 32 cols
[2025-06-04 00:19:17] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:19:17] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-04 00:19:17] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
[2025-06-04 00:19:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:19:17] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:19:17] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2025-06-04 00:19:17] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
[2025-06-04 00:19:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 7/32 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:17] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:17] [INFO ] Deduced a trap composed of 13 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:19:17] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 39/71 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/71 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/72 variables, and 42 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 7/32 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:19:18] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 39/71 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 33/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/72 variables, and 76 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2756ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2756ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/66 places, 47/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2919 ms. Remains : 32/66 places, 47/116 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-01-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLFireability-15 finished in 3042 ms.
All properties solved by simple procedures.
Total runtime 141566 ms.
BK_STOP 1748996360175
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-174867008100540"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;