Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640604200788.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is HealthRecord-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604200788
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-12-LTLFireability-00
FORMULA_NAME HealthRecord-PT-12-LTLFireability-01
FORMULA_NAME HealthRecord-PT-12-LTLFireability-02
FORMULA_NAME HealthRecord-PT-12-LTLFireability-03
FORMULA_NAME HealthRecord-PT-12-LTLFireability-04
FORMULA_NAME HealthRecord-PT-12-LTLFireability-05
FORMULA_NAME HealthRecord-PT-12-LTLFireability-06
FORMULA_NAME HealthRecord-PT-12-LTLFireability-07
FORMULA_NAME HealthRecord-PT-12-LTLFireability-08
FORMULA_NAME HealthRecord-PT-12-LTLFireability-09
FORMULA_NAME HealthRecord-PT-12-LTLFireability-10
FORMULA_NAME HealthRecord-PT-12-LTLFireability-11
FORMULA_NAME HealthRecord-PT-12-LTLFireability-12
FORMULA_NAME HealthRecord-PT-12-LTLFireability-13
FORMULA_NAME HealthRecord-PT-12-LTLFireability-14
FORMULA_NAME HealthRecord-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716520576181

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 03:16:17] [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]
[2024-05-24 03:16:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:16:17] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-24 03:16:17] [INFO ] Transformed 160 places.
[2024-05-24 03:16:17] [INFO ] Transformed 340 transitions.
[2024-05-24 03:16:17] [INFO ] Found NUPN structural information;
[2024-05-24 03:16:17] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 85 transition count 171
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 85 transition count 171
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 155 place count 80 transition count 161
Iterating global reduction 0 with 5 rules applied. Total rules applied 160 place count 80 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 79 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 79 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 78 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 78 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 167 place count 78 transition count 153
Applied a total of 167 rules in 69 ms. Remains 78 /160 variables (removed 82) and now considering 153/312 (removed 159) transitions.
[2024-05-24 03:16:17] [INFO ] Flow matrix only has 150 transitions (discarded 3 similar events)
// Phase 1: matrix 150 rows 78 cols
[2024-05-24 03:16:17] [INFO ] Computed 9 invariants in 11 ms
[2024-05-24 03:16:18] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-24 03:16:18] [INFO ] Flow matrix only has 150 transitions (discarded 3 similar events)
[2024-05-24 03:16:18] [INFO ] Invariant cache hit.
[2024-05-24 03:16:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:18] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-24 03:16:18] [INFO ] Flow matrix only has 150 transitions (discarded 3 similar events)
[2024-05-24 03:16:18] [INFO ] Invariant cache hit.
[2024-05-24 03:16:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 156 ms to minimize.
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-05-24 03:16:19] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2024-05-24 03:16:20] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:16:20] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:16:20] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:16:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 03:16:20] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:16:20] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 03:16:21] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:16:21] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 149/227 variables, 78/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 1/228 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 03:16:24] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/228 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 03:16:25] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/228 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 107 constraints, problems are : Problem set: 0 solved, 152 unsolved in 9231 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 03:16:28] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:16:28] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 6 ms to minimize.
[2024-05-24 03:16:28] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:16:28] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 03:16:28] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 149/227 variables, 78/111 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 152/263 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 1/228 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 264 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7179 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 24/24 constraints]
After SMT, in 16533ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 16550ms
Starting structural reductions in LTL mode, iteration 1 : 78/160 places, 153/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17016 ms. Remains : 78/160 places, 153/312 transitions.
Support contains 31 out of 78 places after structural reductions.
[2024-05-24 03:16:34] [INFO ] Flatten gal took : 44 ms
[2024-05-24 03:16:34] [INFO ] Flatten gal took : 17 ms
[2024-05-24 03:16:35] [INFO ] Input system was already deterministic with 153 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (2886 resets) in 1424 ms. (28 steps per ms) remains 11/28 properties
BEST_FIRST walk for 40004 steps (358 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (357 resets) in 60 ms. (655 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (356 resets) in 88 ms. (449 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (353 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (345 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (360 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (359 resets) in 39 ms. (1000 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (360 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (351 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (346 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (356 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
[2024-05-24 03:16:35] [INFO ] Flow matrix only has 150 transitions (discarded 3 similar events)
[2024-05-24 03:16:35] [INFO ] Invariant cache hit.
[2024-05-24 03:16:35] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 52/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:36] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2024-05-24 03:16:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:16:36] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 13/78 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 149/227 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/228 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 91 constraints, problems are : Problem set: 0 solved, 9 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 52/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:36] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:16:36] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:36] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:36] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:16:36] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:16:37] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:37] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:16:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 13/78 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 149/227 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 03:16:37] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/228 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/228 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 109 constraints, problems are : Problem set: 0 solved, 9 unsolved in 886 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 12/12 constraints]
After SMT, in 1671ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 8 properties in 273 ms.
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 95 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 292 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 73 transition count 139
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 71 transition count 137
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 70 transition count 135
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13 place count 69 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 13 place count 69 transition count 133
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 15 place count 68 transition count 133
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 35 place count 48 transition count 93
Iterating global reduction 4 with 20 rules applied. Total rules applied 55 place count 48 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 58 place count 48 transition count 90
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 63 place count 43 transition count 79
Iterating global reduction 5 with 5 rules applied. Total rules applied 68 place count 43 transition count 79
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 74 place count 43 transition count 73
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 76 place count 41 transition count 68
Iterating global reduction 6 with 2 rules applied. Total rules applied 78 place count 41 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 81 place count 41 transition count 65
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 82 place count 40 transition count 63
Iterating global reduction 7 with 1 rules applied. Total rules applied 83 place count 40 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 86 place count 40 transition count 60
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 96 place count 35 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 97 place count 35 transition count 90
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 102 place count 35 transition count 85
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 107 place count 30 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 109 place count 30 transition count 83
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 111 place count 30 transition count 149
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 114 place count 28 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 117 place count 28 transition count 145
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 118 place count 27 transition count 109
Iterating global reduction 10 with 1 rules applied. Total rules applied 119 place count 27 transition count 109
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 120 place count 26 transition count 107
Iterating global reduction 10 with 1 rules applied. Total rules applied 121 place count 26 transition count 107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 131 place count 26 transition count 97
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 138 place count 26 transition count 97
Applied a total of 138 rules in 88 ms. Remains 26 /78 variables (removed 52) and now considering 97/153 (removed 56) transitions.
Running 81 sub problems to find dead transitions.
[2024-05-24 03:16:37] [INFO ] Flow matrix only has 73 transitions (discarded 24 similar events)
// Phase 1: matrix 73 rows 26 cols
[2024-05-24 03:16:38] [INFO ] Computed 8 invariants in 4 ms
[2024-05-24 03:16:38] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Problem TDEAD29 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
At refinement iteration 3 (OVERLAPS) 73/99 variables, 26/34 constraints. Problems are: Problem set: 8 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 19/53 constraints. Problems are: Problem set: 8 solved, 73 unsolved
[2024-05-24 03:16:38] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/54 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/54 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/54 constraints. Problems are: Problem set: 9 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 54 constraints, problems are : Problem set: 9 solved, 72 unsolved in 898 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 8/8 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/9 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/99 variables, 26/35 constraints. Problems are: Problem set: 9 solved, 72 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 19/54 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 70/124 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/124 constraints. Problems are: Problem set: 11 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/124 constraints. Problems are: Problem set: 11 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 124 constraints, problems are : Problem set: 11 solved, 70 unsolved in 1275 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 70/81 constraints, Known Traps: 1/1 constraints]
After SMT, in 2265ms problems are : Problem set: 11 solved, 70 unsolved
Search for dead transitions found 11 dead transitions in 2267ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/78 places, 86/153 transitions.
Graph (complete) has 90 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 25 /26 variables (removed 1) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2365 ms. Remains : 25/78 places, 86/153 transitions.
RANDOM walk for 40000 steps (6251 resets) in 526 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35893 steps (824 resets) in 71 ms. (498 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-12-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HealthRecord-PT-12-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 6 stabilizing places and 9 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&G(p2)&&F(p3))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 76 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 55 transition count 111
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 55 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 42 place count 55 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 51 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 51 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 51 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 50 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 50 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 49 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 49 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 49 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 47 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 47 transition count 83
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 78 place count 42 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 42 transition count 103
Applied a total of 80 rules in 25 ms. Remains 42 /78 variables (removed 36) and now considering 103/153 (removed 50) transitions.
[2024-05-24 03:16:40] [INFO ] Flow matrix only has 88 transitions (discarded 15 similar events)
// Phase 1: matrix 88 rows 42 cols
[2024-05-24 03:16:40] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:16:40] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:16:40] [INFO ] Flow matrix only has 88 transitions (discarded 15 similar events)
[2024-05-24 03:16:40] [INFO ] Invariant cache hit.
[2024-05-24 03:16:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 03:16:41] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-24 03:16:41] [INFO ] Redundant transitions in 18 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-24 03:16:41] [INFO ] Flow matrix only has 88 transitions (discarded 15 similar events)
[2024-05-24 03:16:41] [INFO ] Invariant cache hit.
[2024-05-24 03:16:41] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 03:16:41] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:16:41] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:16:41] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 87/129 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 63 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 87/129 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 87/149 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 150 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2512 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints]
After SMT, in 4324ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 4328ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/78 places, 103/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4478 ms. Remains : 42/78 places, 103/153 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-02 finished in 4882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G((p1&&F(p2))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 89 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 55 transition count 112
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 55 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 40 place count 55 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 51 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 51 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 51 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 49 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 49 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 49 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 48 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 48 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 48 transition count 85
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 64 place count 47 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 47 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 69 place count 45 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 72 place count 45 transition count 96
Applied a total of 72 rules in 23 ms. Remains 45 /78 variables (removed 33) and now considering 96/153 (removed 57) transitions.
[2024-05-24 03:16:45] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
// Phase 1: matrix 87 rows 45 cols
[2024-05-24 03:16:45] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:16:45] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:16:45] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2024-05-24 03:16:45] [INFO ] Invariant cache hit.
[2024-05-24 03:16:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 03:16:45] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-24 03:16:45] [INFO ] Redundant transitions in 29 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-24 03:16:45] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2024-05-24 03:16:45] [INFO ] Invariant cache hit.
[2024-05-24 03:16:45] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 8/45 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:16:46] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:16:46] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:16:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:16:46] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 86/131 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/132 variables, and 72 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1121 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 8/45 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:16:47] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 86/131 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 80/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/132 variables, and 153 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1541 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
After SMT, in 2711ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2713ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/78 places, 96/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2859 ms. Remains : 45/78 places, 96/153 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-03 finished in 3046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 59 transition count 115
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 59 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 59 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 55 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 55 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 55 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 54 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 54 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 54 transition count 92
Applied a total of 60 rules in 6 ms. Remains 54 /78 variables (removed 24) and now considering 92/153 (removed 61) transitions.
[2024-05-24 03:16:48] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 54 cols
[2024-05-24 03:16:48] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:16:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:16:48] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 03:16:48] [INFO ] Invariant cache hit.
[2024-05-24 03:16:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:48] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 03:16:48] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 03:16:48] [INFO ] Invariant cache hit.
[2024-05-24 03:16:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:16:49] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:16:49] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:16:49] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:16:49] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 68 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1924 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:16:51] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:16:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:16:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 91/161 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 162 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2711 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints]
After SMT, in 4659ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4661ms
Starting structural reductions in LTL mode, iteration 1 : 54/78 places, 92/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4749 ms. Remains : 54/78 places, 92/153 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-05 finished in 4900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 93 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 55 transition count 111
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 55 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 42 place count 55 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 50 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 50 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 50 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 48 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 48 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 48 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 47 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 47 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 47 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 45 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 45 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 87 place count 39 transition count 107
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 89 place count 39 transition count 105
Applied a total of 89 rules in 27 ms. Remains 39 /78 variables (removed 39) and now considering 105/153 (removed 48) transitions.
[2024-05-24 03:16:53] [INFO ] Flow matrix only has 90 transitions (discarded 15 similar events)
// Phase 1: matrix 90 rows 39 cols
[2024-05-24 03:16:53] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:16:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 03:16:53] [INFO ] Flow matrix only has 90 transitions (discarded 15 similar events)
[2024-05-24 03:16:53] [INFO ] Invariant cache hit.
[2024-05-24 03:16:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 03:16:53] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-24 03:16:53] [INFO ] Redundant transitions in 29 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-24 03:16:53] [INFO ] Flow matrix only has 90 transitions (discarded 15 similar events)
[2024-05-24 03:16:53] [INFO ] Invariant cache hit.
[2024-05-24 03:16:53] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:16:54] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:16:54] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:16:54] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:16:54] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:16:54] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 4 ms to minimize.
[2024-05-24 03:16:54] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:16:54] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 89/128 variables, 39/55 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/129 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 73 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1944 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:16:56] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:16:56] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 89/128 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 89/163 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 164 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2751 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 9/9 constraints]
After SMT, in 4749ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4751ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/78 places, 105/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4908 ms. Remains : 39/78 places, 105/153 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 1 ms.
FORMULA HealthRecord-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-07 finished in 4995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 57 transition count 111
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 57 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 57 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 52 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 52 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 52 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 50 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 50 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 50 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 49 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 49 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 49 transition count 78
Applied a total of 73 rules in 4 ms. Remains 49 /78 variables (removed 29) and now considering 78/153 (removed 75) transitions.
[2024-05-24 03:16:58] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 49 cols
[2024-05-24 03:16:58] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:16:58] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:16:58] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2024-05-24 03:16:58] [INFO ] Invariant cache hit.
[2024-05-24 03:16:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:16:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-24 03:16:58] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2024-05-24 03:16:58] [INFO ] Invariant cache hit.
[2024-05-24 03:16:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:16:59] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:16:59] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 74/123 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 61 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:17:00] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 74/123 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 77/138 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 139 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1883 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 3/3 constraints]
After SMT, in 3182ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3183ms
Starting structural reductions in LTL mode, iteration 1 : 49/78 places, 78/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3270 ms. Remains : 49/78 places, 78/153 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-08 finished in 3359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 58 transition count 113
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 58 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 58 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 53 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 53 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 53 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 51 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 51 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 50 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 50 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 50 transition count 80
Applied a total of 71 rules in 3 ms. Remains 50 /78 variables (removed 28) and now considering 80/153 (removed 73) transitions.
[2024-05-24 03:17:02] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 50 cols
[2024-05-24 03:17:02] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:17:02] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:17:02] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 03:17:02] [INFO ] Invariant cache hit.
[2024-05-24 03:17:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:02] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-24 03:17:02] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 03:17:02] [INFO ] Invariant cache hit.
[2024-05-24 03:17:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:17:02] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/126 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 63 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1513 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:17:03] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/126 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 79/142 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 143 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1957 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints]
After SMT, in 3487ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3488ms
Starting structural reductions in LTL mode, iteration 1 : 50/78 places, 80/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3581 ms. Remains : 50/78 places, 80/153 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-10
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-10 finished in 3664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p1)||G(!p2)))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 58 transition count 113
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 58 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 58 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 53 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 53 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 53 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 52 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 52 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 52 transition count 89
Applied a total of 63 rules in 4 ms. Remains 52 /78 variables (removed 26) and now considering 89/153 (removed 64) transitions.
[2024-05-24 03:17:05] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2024-05-24 03:17:05] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:17:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:17:05] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 03:17:05] [INFO ] Invariant cache hit.
[2024-05-24 03:17:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-24 03:17:05] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 03:17:05] [INFO ] Invariant cache hit.
[2024-05-24 03:17:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 03:17:06] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:17:06] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 85/137 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 03:17:06] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 65 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 03:17:07] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 03:17:08] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 85/137 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 88/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/138 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 155 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2561 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 5/5 constraints]
After SMT, in 4432ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 4433ms
Starting structural reductions in LTL mode, iteration 1 : 52/78 places, 89/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4548 ms. Remains : 52/78 places, 89/153 transitions.
Stuttering acceptance computed with spot in 338 ms :[true, (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 280 ms.
Product exploration explored 100000 steps with 1 reset in 138 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X p1), (X (AND p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 39 factoid took 134 ms. Reduced automaton from 9 states, 29 edges and 3 AP (stutter sensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 356 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), p2, (AND p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (2887 resets) in 382 ms. (104 steps per ms) remains 11/23 properties
BEST_FIRST walk for 40004 steps (361 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (360 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (358 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (357 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (356 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (358 resets) in 28 ms. (1379 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (362 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (354 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (353 resets) in 214 ms. (186 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (358 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
[2024-05-24 03:17:11] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 03:17:11] [INFO ] Invariant cache hit.
[2024-05-24 03:17:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 85/137 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 62 constraints, problems are : Problem set: 0 solved, 9 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf7 is UNSAT
Problem apf11 is UNSAT
Problem apf17 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/40 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-24 03:17:12] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 12/52 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 85/137 variables, 52/62 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 6/68 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/138 variables, 1/69 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/69 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/69 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 69 constraints, problems are : Problem set: 3 solved, 6 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 387ms problems are : Problem set: 3 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 945 steps, including 51 resets, run visited all 2 properties in 4 ms. (steps per millisecond=236 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 29 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X p1), (X (AND p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (G (OR p0 (NOT p2) p1)), (G (OR p0 p2 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p0 p1))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 42 factoid took 886 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) p2), (NOT p0), (AND (NOT p1) (NOT p0)), p2]
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) p2), (NOT p0), (AND (NOT p1) (NOT p0)), p2]
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 89/89 transitions.
Graph (trivial) has 39 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 46 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 46 transition count 81
Applied a total of 4 rules in 13 ms. Remains 46 /52 variables (removed 6) and now considering 81/89 (removed 8) transitions.
[2024-05-24 03:17:13] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
// Phase 1: matrix 75 rows 46 cols
[2024-05-24 03:17:13] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:17:13] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:17:13] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2024-05-24 03:17:13] [INFO ] Invariant cache hit.
[2024-05-24 03:17:13] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-24 03:17:13] [INFO ] Redundant transitions in 16 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-24 03:17:13] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2024-05-24 03:17:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/46 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:17:14] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-24 03:17:14] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:17:14] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 74/120 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/121 variables, and 58 constraints, problems are : Problem set: 0 solved, 65 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/46 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:17:14] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:17:15] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:17:15] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 74/120 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 65/126 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/121 variables, and 126 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 6/6 constraints]
After SMT, in 2090ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2091ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/52 places, 81/89 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2231 ms. Remains : 46/52 places, 81/89 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p0 p2))), (X p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p2 p1))), (X p0), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X p1)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 47 factoid took 353 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p1), p2, (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (3682 resets) in 339 ms. (117 steps per ms) remains 11/23 properties
BEST_FIRST walk for 40004 steps (421 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (432 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (431 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (415 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (425 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (417 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (422 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (423 resets) in 35 ms. (1111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (423 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (419 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (419 resets) in 37 ms. (1052 steps per ms) remains 11/11 properties
[2024-05-24 03:17:17] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2024-05-24 03:17:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 29/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 11/46 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 74/120 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/121 variables, and 55 constraints, problems are : Problem set: 0 solved, 11 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem apf7 is UNSAT
Problem apf11 is UNSAT
Problem apf17 is UNSAT
At refinement iteration 1 (OVERLAPS) 29/35 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-24 03:17:17] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:17:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/46 variables, 4/11 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 74/120 variables, 46/57 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 8/65 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/121 variables, and 65 constraints, problems are : Problem set: 3 solved, 8 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 389ms problems are : Problem set: 3 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1039 steps, including 63 resets, run visited all 4 properties in 7 ms. (steps per millisecond=148 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 30 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p0 p2))), (X p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p2 p1))), (X p0), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X p1)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (G (OR p0 (NOT p2) p1)), (G (OR p0 p2 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p0 p1))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 50 factoid took 719 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) p2), (NOT p0), (AND (NOT p1) (NOT p0)), p2]
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) p2), (NOT p0), (AND (NOT p1) (NOT p0)), p2]
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) p2), (NOT p0), (AND (NOT p1) (NOT p0)), p2]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 131 ms.
Built C files in :
/tmp/ltsmin3167604293070198144
[2024-05-24 03:17:19] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-24 03:17:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 03:17:19] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-24 03:17:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 03:17:19] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-24 03:17:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 03:17:19] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3167604293070198144
Running compilation step : cd /tmp/ltsmin3167604293070198144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 340 ms.
Running link step : cd /tmp/ltsmin3167604293070198144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3167604293070198144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2542768222706335487.hoa' '--buchi-type=spotba'
LTSmin run took 293 ms.
FORMULA HealthRecord-PT-12-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLFireability-11 finished in 14414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U p1)||(p2 U p1)))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 82 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 53 transition count 108
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 53 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 44 place count 53 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 49 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 49 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 49 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 48 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 48 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 47 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 47 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 47 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 45 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 45 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 71 place count 43 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 74 place count 43 transition count 97
Applied a total of 74 rules in 14 ms. Remains 43 /78 variables (removed 35) and now considering 97/153 (removed 56) transitions.
[2024-05-24 03:17:20] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
// Phase 1: matrix 87 rows 43 cols
[2024-05-24 03:17:20] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:17:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 03:17:20] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
[2024-05-24 03:17:20] [INFO ] Invariant cache hit.
[2024-05-24 03:17:20] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 03:17:20] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-24 03:17:20] [INFO ] Redundant transitions in 16 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-24 03:17:20] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
[2024-05-24 03:17:20] [INFO ] Invariant cache hit.
[2024-05-24 03:17:20] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 8/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:17:20] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:17:20] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:17:20] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:17:20] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 86/129 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/130 variables, and 71 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 8/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:17:21] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 86/129 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 81/153 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/130 variables, and 153 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1555 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints]
After SMT, in 2728ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 2728ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/78 places, 97/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2858 ms. Remains : 43/78 places, 97/153 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-12 finished in 3068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((p1 U (p2||G(p1)))))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 57 transition count 111
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 57 transition count 111
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 53 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 53 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 53 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 52 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 52 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 52 transition count 91
Applied a total of 61 rules in 7 ms. Remains 52 /78 variables (removed 26) and now considering 91/153 (removed 62) transitions.
[2024-05-24 03:17:23] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 52 cols
[2024-05-24 03:17:23] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:17:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:17:23] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2024-05-24 03:17:23] [INFO ] Invariant cache hit.
[2024-05-24 03:17:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:23] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-05-24 03:17:23] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2024-05-24 03:17:23] [INFO ] Invariant cache hit.
[2024-05-24 03:17:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-24 03:17:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:17:23] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 87/139 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 1/140 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 64 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1501 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-24 03:17:25] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:17:25] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:17:25] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 87/139 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 90/156 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/140 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 157 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2478 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 5/5 constraints]
After SMT, in 4013ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 4014ms
Starting structural reductions in LTL mode, iteration 1 : 52/78 places, 91/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4130 ms. Remains : 52/78 places, 91/153 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-13
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-13 finished in 4267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 58 transition count 113
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 58 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 58 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 54 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 54 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 52 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 52 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 52 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 51 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 51 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 51 transition count 83
Applied a total of 68 rules in 7 ms. Remains 51 /78 variables (removed 27) and now considering 83/153 (removed 70) transitions.
[2024-05-24 03:17:27] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 51 cols
[2024-05-24 03:17:27] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:17:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 03:17:27] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-05-24 03:17:27] [INFO ] Invariant cache hit.
[2024-05-24 03:17:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:17:27] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-24 03:17:27] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-05-24 03:17:27] [INFO ] Invariant cache hit.
[2024-05-24 03:17:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:17:27] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:17:27] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 79/130 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 63 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1328 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:17:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 79/130 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 82/146 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 147 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2094 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 4/4 constraints]
After SMT, in 3441ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3442ms
Starting structural reductions in LTL mode, iteration 1 : 51/78 places, 83/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3528 ms. Remains : 51/78 places, 83/153 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-14 finished in 3666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 93 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 54 transition count 110
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 54 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 42 place count 54 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 50 transition count 98
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 50 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 50 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 48 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 48 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 48 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 47 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 47 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 65 place count 47 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 69 place count 45 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 45 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 74 place count 43 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 77 place count 43 transition count 92
Applied a total of 77 rules in 17 ms. Remains 43 /78 variables (removed 35) and now considering 92/153 (removed 61) transitions.
[2024-05-24 03:17:31] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
// Phase 1: matrix 83 rows 43 cols
[2024-05-24 03:17:31] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:17:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:17:31] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-05-24 03:17:31] [INFO ] Invariant cache hit.
[2024-05-24 03:17:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 03:17:31] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-24 03:17:31] [INFO ] Redundant transitions in 18 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-24 03:17:31] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-05-24 03:17:31] [INFO ] Invariant cache hit.
[2024-05-24 03:17:31] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 8/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:17:31] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 82/125 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/126 variables, and 71 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1112 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 8/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:17:32] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 82/125 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 76/149 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/126 variables, and 149 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 7/7 constraints]
After SMT, in 2605ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2606ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/78 places, 92/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2726 ms. Remains : 43/78 places, 92/153 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-15 finished in 2829 ms.
All properties solved by simple procedures.
Total runtime 76585 ms.

BK_STOP 1716520653976

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-12"
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-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-12, 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 r180-tall-171640604200788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;