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.r179-tall-171640602300780.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 greatspnxred
Input is HealthRecord-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300780
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 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 70K 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-11-LTLFireability-00
FORMULA_NAME HealthRecord-PT-11-LTLFireability-01
FORMULA_NAME HealthRecord-PT-11-LTLFireability-02
FORMULA_NAME HealthRecord-PT-11-LTLFireability-03
FORMULA_NAME HealthRecord-PT-11-LTLFireability-04
FORMULA_NAME HealthRecord-PT-11-LTLFireability-05
FORMULA_NAME HealthRecord-PT-11-LTLFireability-06
FORMULA_NAME HealthRecord-PT-11-LTLFireability-07
FORMULA_NAME HealthRecord-PT-11-LTLFireability-08
FORMULA_NAME HealthRecord-PT-11-LTLFireability-09
FORMULA_NAME HealthRecord-PT-11-LTLFireability-10
FORMULA_NAME HealthRecord-PT-11-LTLFireability-11
FORMULA_NAME HealthRecord-PT-11-LTLFireability-12
FORMULA_NAME HealthRecord-PT-11-LTLFireability-13
FORMULA_NAME HealthRecord-PT-11-LTLFireability-14
FORMULA_NAME HealthRecord-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716490936171

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:02:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 19:02:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:02:17] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-23 19:02:17] [INFO ] Transformed 159 places.
[2024-05-23 19:02:17] [INFO ] Transformed 334 transitions.
[2024-05-23 19:02:17] [INFO ] Found NUPN structural information;
[2024-05-23 19:02:17] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 81 transition count 159
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 81 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 162 place count 75 transition count 147
Iterating global reduction 0 with 6 rules applied. Total rules applied 168 place count 75 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 170 place count 75 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 74 transition count 142
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 74 transition count 142
Applied a total of 172 rules in 37 ms. Remains 74 /159 variables (removed 85) and now considering 142/307 (removed 165) transitions.
[2024-05-23 19:02:17] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
// Phase 1: matrix 138 rows 74 cols
[2024-05-23 19:02:17] [INFO ] Computed 10 invariants in 6 ms
[2024-05-23 19:02:17] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-23 19:02:17] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
[2024-05-23 19:02:17] [INFO ] Invariant cache hit.
[2024-05-23 19:02:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:02:18] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2024-05-23 19:02:18] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
[2024-05-23 19:02:18] [INFO ] Invariant cache hit.
[2024-05-23 19:02:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:02:19] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 8 ms to minimize.
[2024-05-23 19:02:19] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
[2024-05-23 19:02:19] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:02:19] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:02:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:02:19] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:02:19] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:02:19] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:02:19] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:02:20] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:02:20] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:02:20] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:02:20] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 137/211 variables, 74/97 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 1/212 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 98 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:02:23] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:02:23] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:02:24] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:02:24] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:02:24] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:02:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:02:24] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:02:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:02:24] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:02:24] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:02:25] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:02:25] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:02:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 137/211 variables, 74/110 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 141/251 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 1/212 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 15 (OVERLAPS) 0/212 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 252 constraints, problems are : Problem set: 0 solved, 141 unsolved in 7833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 26/26 constraints]
After SMT, in 13011ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 13035ms
Starting structural reductions in LTL mode, iteration 1 : 74/159 places, 142/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13394 ms. Remains : 74/159 places, 142/307 transitions.
Support contains 26 out of 74 places after structural reductions.
[2024-05-23 19:02:31] [INFO ] Flatten gal took : 33 ms
[2024-05-23 19:02:31] [INFO ] Flatten gal took : 12 ms
[2024-05-23 19:02:31] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 40000 steps (2686 resets) in 1788 ms. (22 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40004 steps (395 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (399 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (383 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (390 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (395 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (397 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (396 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (380 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (392 resets) in 30 ms. (1290 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (386 resets) in 34 ms. (1142 steps per ms) remains 10/10 properties
[2024-05-23 19:02:32] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
[2024-05-23 19:02:32] [INFO ] Invariant cache hit.
[2024-05-23 19:02:32] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 34/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 28/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 19:02:32] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:02:32] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 137/211 variables, 74/86 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/212 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 87 constraints, problems are : Problem set: 0 solved, 10 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 34/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 19:02:32] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:02:32] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:02:32] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:02:32] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:02:32] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:02:32] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 28/74 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 137/211 variables, 74/92 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 19:02:33] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/212 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 104 constraints, problems are : Problem set: 0 solved, 10 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 9/9 constraints]
After SMT, in 930ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 317 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=158 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 64 ms.
FORMULA HealthRecord-PT-11-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 8 stabilizing places and 12 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' '!(X(X((p0&&F(G(p1))))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 59 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 59 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 59 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 54 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 54 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 50 place count 54 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 52 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 52 transition count 87
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 52 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 51 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 51 transition count 82
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 51 transition count 79
Applied a total of 62 rules in 7 ms. Remains 51 /74 variables (removed 23) and now considering 79/142 (removed 63) transitions.
[2024-05-23 19:02:33] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 51 cols
[2024-05-23 19:02:33] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:02:33] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 19:02:33] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-23 19:02:33] [INFO ] Invariant cache hit.
[2024-05-23 19:02:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:02:33] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-23 19:02:33] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-23 19:02:33] [INFO ] Invariant cache hit.
[2024-05-23 19:02:33] [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, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-23 19:02:34] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:02:34] [INFO ] Deduced a trap composed of 5 places in 23 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, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/126 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 63 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1285 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-23 19:02:35] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-23 19:02:35] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:02:35] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
[2024-05-23 19:02:35] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 75/126 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 78/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 145 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2139 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints]
After SMT, in 3446ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3447ms
Starting structural reductions in LTL mode, iteration 1 : 51/74 places, 79/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3609 ms. Remains : 51/74 places, 79/142 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-01
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 3 ms.
FORMULA HealthRecord-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLFireability-01 finished in 4001 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((X(p0)&&G((p1||G((p2||F(p3))))))))'
Support contains 7 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 59 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 59 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 59 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 56 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 56 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 43 place count 56 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 55 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 55 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 54 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 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 50 place count 54 transition count 92
Applied a total of 50 rules in 9 ms. Remains 54 /74 variables (removed 20) and now considering 92/142 (removed 50) transitions.
[2024-05-23 19:02:37] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 54 cols
[2024-05-23 19:02:37] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:02:37] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 19:02:37] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-23 19:02:37] [INFO ] Invariant cache hit.
[2024-05-23 19:02:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:02:37] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-23 19:02:37] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-23 19:02:37] [INFO ] Invariant cache hit.
[2024-05-23 19:02:37] [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-23 19:02:38] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:02:38] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/142 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/143 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 66 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1543 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: 2/2 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, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-23 19:02:39] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:02:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/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, 91/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-23 19:02:40] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 160 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3149 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: 5/5 constraints]
After SMT, in 4730ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4732ms
Starting structural reductions in LTL mode, iteration 1 : 54/74 places, 92/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4838 ms. Remains : 54/74 places, 92/142 transitions.
Stuttering acceptance computed with spot in 610 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-02
Product exploration explored 100000 steps with 5 reset in 251 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 161 ms. Reduced automaton from 12 states, 50 edges and 4 AP (stutter sensitive) to 11 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 603 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (2671 resets) in 377 ms. (105 steps per ms) remains 11/15 properties
BEST_FIRST walk for 40002 steps (398 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (383 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (388 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (392 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (377 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (395 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (391 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (390 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (388 resets) in 353 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (384 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (390 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
[2024-05-23 19:02:44] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-23 19:02:44] [INFO ] Invariant cache hit.
[2024-05-23 19:02:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem apf10 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/42 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/54 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/63 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/63 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/64 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 64 constraints, problems are : Problem set: 2 solved, 9 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 35/42 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-23 19:02:45] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem apf9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/54 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 88/142 variables, 54/64 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 8/72 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-23 19:02:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:02:45] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 2/74 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/74 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/143 variables, 1/75 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/75 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/143 variables, 0/75 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 75 constraints, problems are : Problem set: 3 solved, 8 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 540ms problems are : Problem set: 3 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 6 properties in 209 ms.
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 92/92 transitions.
Graph (trivial) has 41 edges and 54 vertex of which 10 / 54 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 187 edges and 49 vertex of which 33 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 33 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 22 place count 33 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 30 transition count 50
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 28 transition count 46
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 28 transition count 46
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 1 with 4 rules applied. Total rules applied 36 place count 26 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 25 transition count 43
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 9 edges and 23 vertex of which 2 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 22 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 22 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 43 place count 22 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 49 place count 19 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 19 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 19 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 18 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 18 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 18 transition count 31
Applied a total of 57 rules in 31 ms. Remains 18 /54 variables (removed 36) and now considering 31/92 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 18/54 places, 31/92 transitions.
RANDOM walk for 23827 steps (3784 resets) in 239 ms. (99 steps per ms) remains 0/2 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (G (OR p0 p1 (NOT p2) p3)), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 p1 p2 p3))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p1 p2 p3))), (F (NOT (AND (OR (NOT p1) p3) (OR (NOT p2) p3)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p3)), (F (NOT (AND (OR p0 (NOT p1) p3) (OR p0 (NOT p2) p3))))]
Knowledge based reduction with 30 factoid took 757 ms. Reduced automaton from 11 states, 43 edges and 4 AP (stutter sensitive) to 10 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 450 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 544 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-23 19:02:47] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-23 19:02:47] [INFO ] Invariant cache hit.
[2024-05-23 19:02:47] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 19:02:47] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-23 19:02:47] [INFO ] Invariant cache hit.
[2024-05-23 19:02:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:02:47] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-23 19:02:47] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-23 19:02:47] [INFO ] Invariant cache hit.
[2024-05-23 19:02:47] [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-23 19:02:47] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:02:47] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/142 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/143 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 66 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1591 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: 2/2 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, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-23 19:02:49] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:02:49] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/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, 91/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-23 19:02:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 160 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2998 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: 5/5 constraints]
After SMT, in 4621ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4623ms
Finished structural reductions in LTL mode , in 1 iterations and 4717 ms. Remains : 54/54 places, 92/92 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 164 ms. Reduced automaton from 10 states, 34 edges and 4 AP (stutter sensitive) to 10 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 500 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (2735 resets) in 153 ms. (259 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (392 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (397 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (379 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (383 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (393 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (394 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
[2024-05-23 19:02:53] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-23 19:02:53] [INFO ] Invariant cache hit.
[2024-05-23 19:02:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 35/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/54 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 64 constraints, problems are : Problem set: 0 solved, 6 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 35/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 19:02:53] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 12/54 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 88/142 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 71 constraints, problems are : Problem set: 0 solved, 6 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 252 ms.
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 92/92 transitions.
Graph (trivial) has 43 edges and 54 vertex of which 10 / 54 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 187 edges and 49 vertex of which 33 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 33 transition count 51
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 24 place count 33 transition count 48
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 30 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 26 transition count 42
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 26 transition count 42
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 26 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 25 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 25 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 24 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 24 transition count 36
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 24 transition count 33
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 52 place count 22 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 21 transition count 30
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 7 edges and 19 vertex of which 2 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 18 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 59 place count 18 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 59 place count 18 transition count 25
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 63 place count 16 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 67 place count 16 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 15 transition count 20
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 15 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 71 place count 15 transition count 19
Applied a total of 71 rules in 16 ms. Remains 15 /54 variables (removed 39) and now considering 19/92 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 15/54 places, 19/92 transitions.
RANDOM walk for 30261 steps (4740 resets) in 27 ms. (1080 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p3 p0))), (F (NOT (OR p1 p2 p3))), (F (NOT (AND (OR (NOT p1) p3) (OR (NOT p2) p3)))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 512 ms. Reduced automaton from 10 states, 34 edges and 4 AP (stutter sensitive) to 10 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 497 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 481 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 462 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 6 reset in 55 ms.
Product exploration explored 100000 steps with 3 reset in 114 ms.
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-23 19:02:56] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-23 19:02:56] [INFO ] Invariant cache hit.
[2024-05-23 19:02:56] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 19:02:56] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-23 19:02:56] [INFO ] Invariant cache hit.
[2024-05-23 19:02:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:02:56] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-23 19:02:56] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-23 19:02:56] [INFO ] Invariant cache hit.
[2024-05-23 19:02:56] [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-23 19:02:56] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:02:56] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/142 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/143 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 66 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1581 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: 2/2 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, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-23 19:02:57] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:02:58] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/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, 91/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-23 19:02:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 160 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3103 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: 5/5 constraints]
After SMT, in 4711ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4712ms
Finished structural reductions in LTL mode , in 1 iterations and 4806 ms. Remains : 54/54 places, 92/92 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-02 finished in 23238 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 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Graph (trivial) has 85 edges and 74 vertex of which 10 / 74 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 54 transition count 109
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 54 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 50 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 50 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 44 place count 50 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 48 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 48 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 51 place count 48 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 47 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 47 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 56 place count 47 transition count 80
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 58 place count 46 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 46 transition count 78
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 63 place count 44 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 67 place count 44 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 42 transition count 88
Applied a total of 69 rules in 22 ms. Remains 42 /74 variables (removed 32) and now considering 88/142 (removed 54) transitions.
[2024-05-23 19:03:00] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
// Phase 1: matrix 78 rows 42 cols
[2024-05-23 19:03:00] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:03:00] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-23 19:03:00] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-23 19:03:00] [INFO ] Invariant cache hit.
[2024-05-23 19:03:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 19:03:01] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-23 19:03:01] [INFO ] Redundant transitions in 23 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-23 19:03:01] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-23 19:03:01] [INFO ] Invariant cache hit.
[2024-05-23 19:03:01] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:03:01] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 77/119 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 69 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:03:02] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 77/119 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 74/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 145 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1346 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints]
After SMT, in 2421ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2422ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/74 places, 88/142 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2554 ms. Remains : 42/74 places, 88/142 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 162 ms.
Product exploration explored 100000 steps with 3 reset in 109 ms.
Computed a total of 14 stabilizing places and 29 stable transitions
Computed a total of 14 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 34327 steps (3571 resets) in 55 ms. (612 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 42 /42 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-23 19:03:04] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-23 19:03:04] [INFO ] Invariant cache hit.
[2024-05-23 19:03:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 19:03:04] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-23 19:03:04] [INFO ] Invariant cache hit.
[2024-05-23 19:03:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 19:03:04] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-23 19:03:04] [INFO ] Redundant transitions in 26 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-23 19:03:04] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-23 19:03:04] [INFO ] Invariant cache hit.
[2024-05-23 19:03:04] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:03:04] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-23 19:03:04] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-23 19:03:04] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-23 19:03:04] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 77/119 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 69 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:03:05] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 77/119 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 74/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 145 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints]
After SMT, in 2489ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2490ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2615 ms. Remains : 42/42 places, 88/88 transitions.
Computed a total of 14 stabilizing places and 29 stable transitions
Computed a total of 14 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32814 steps (3424 resets) in 52 ms. (619 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 46 ms.
Product exploration explored 100000 steps with 6 reset in 45 ms.
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-23 19:03:07] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-23 19:03:07] [INFO ] Invariant cache hit.
[2024-05-23 19:03:07] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-23 19:03:07] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-23 19:03:07] [INFO ] Invariant cache hit.
[2024-05-23 19:03:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 19:03:07] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-23 19:03:07] [INFO ] Redundant transitions in 23 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-23 19:03:07] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-23 19:03:07] [INFO ] Invariant cache hit.
[2024-05-23 19:03:07] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:03:08] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-23 19:03:08] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-23 19:03:08] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-23 19:03:08] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 77/119 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 69 constraints, problems are : Problem set: 0 solved, 74 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:03:08] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:03:08] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 77/119 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 74/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 145 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints]
After SMT, in 2410ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2412ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2532 ms. Remains : 42/42 places, 88/88 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-04 finished in 9308 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 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Graph (trivial) has 83 edges and 74 vertex of which 10 / 74 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 56 transition count 112
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 56 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 56 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 52 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 52 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 52 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 50 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 50 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 49 place count 50 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 49 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 49 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 54 place count 49 transition count 83
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 58 place count 47 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 47 transition count 80
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
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 71 place count 41 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 85 place count 41 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
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 89 place count 39 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 39 transition count 115
Applied a total of 90 rules in 22 ms. Remains 39 /74 variables (removed 35) and now considering 115/142 (removed 27) transitions.
[2024-05-23 19:03:10] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
// Phase 1: matrix 98 rows 39 cols
[2024-05-23 19:03:10] [INFO ] Computed 9 invariants in 0 ms
[2024-05-23 19:03:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 19:03:10] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-23 19:03:10] [INFO ] Invariant cache hit.
[2024-05-23 19:03:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 19:03:10] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-23 19:03:10] [INFO ] Redundant transitions in 25 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-23 19:03:10] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-23 19:03:10] [INFO ] Invariant cache hit.
[2024-05-23 19:03:10] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-23 19:03:10] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-23 19:03:10] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:03:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-23 19:03:10] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 97/136 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 24/76 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 77 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1983 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-23 19:03:12] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 97/136 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 24/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 99/176 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/137 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 177 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3052 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints]
After SMT, in 5092ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 5093ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/74 places, 115/142 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5236 ms. Remains : 39/74 places, 115/142 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-06
Product exploration explored 100000 steps with 2 reset in 58 ms.
Product exploration explored 100000 steps with 63 reset in 96 ms.
Computed a total of 24 stabilizing places and 65 stable transitions
Computed a total of 24 stabilizing places and 65 stable transitions
Detected a total of 24/39 stabilizing places and 65/115 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
RANDOM walk for 14875 steps (2381 resets) in 41 ms. (354 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Support contains 1 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 115/115 transitions.
Applied a total of 0 rules in 13 ms. Remains 39 /39 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-23 19:03:16] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-23 19:03:16] [INFO ] Invariant cache hit.
[2024-05-23 19:03:16] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 19:03:16] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-23 19:03:16] [INFO ] Invariant cache hit.
[2024-05-23 19:03:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 19:03:16] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-23 19:03:16] [INFO ] Redundant transitions in 27 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-23 19:03:16] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-23 19:03:16] [INFO ] Invariant cache hit.
[2024-05-23 19:03:16] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-23 19:03:16] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:03:16] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:03:16] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-23 19:03:16] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 97/136 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 24/76 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 77 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2101 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-23 19:03:18] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 97/136 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 24/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 99/176 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/137 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 177 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3241 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints]
After SMT, in 5411ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 5412ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5554 ms. Remains : 39/39 places, 115/115 transitions.
Computed a total of 24 stabilizing places and 65 stable transitions
Computed a total of 24 stabilizing places and 65 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
RANDOM walk for 20489 steps (3290 resets) in 45 ms. (445 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 8 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-23 19:03:22] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-23 19:03:22] [INFO ] Invariant cache hit.
[2024-05-23 19:03:22] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 19:03:22] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-23 19:03:22] [INFO ] Invariant cache hit.
[2024-05-23 19:03:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 19:03:22] [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.
[2024-05-23 19:03:22] [INFO ] Redundant transitions in 43 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-23 19:03:22] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-23 19:03:22] [INFO ] Invariant cache hit.
[2024-05-23 19:03:22] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 97/136 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 24/76 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 77 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2062 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 97/136 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 24/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 99/176 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/137 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 177 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3188 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints]
After SMT, in 5308ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 5309ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5450 ms. Remains : 39/39 places, 115/115 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-06 finished in 17600 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(F((p0||G(p1)||(p2 U p3)))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 60 transition count 115
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 60 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 60 transition count 114
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 56 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 56 transition count 106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 45 place count 56 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 55 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 55 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 54 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 54 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 52 place count 54 transition count 90
Applied a total of 52 rules in 4 ms. Remains 54 /74 variables (removed 20) and now considering 90/142 (removed 52) transitions.
[2024-05-23 19:03:27] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 54 cols
[2024-05-23 19:03:27] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 19:03:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-23 19:03:27] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-23 19:03:27] [INFO ] Invariant cache hit.
[2024-05-23 19:03:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:03:27] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-23 19:03:27] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-23 19:03:27] [INFO ] Invariant cache hit.
[2024-05-23 19:03:27] [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, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 86/140 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/141 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 67 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:03:29] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-23 19:03:30] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 86/140 variables, 54/72 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 89/161 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/141 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 162 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2783 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 9/9 constraints]
After SMT, in 4374ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4375ms
Starting structural reductions in LTL mode, iteration 1 : 54/74 places, 90/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4474 ms. Remains : 54/74 places, 90/142 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3)), (X (NOT p3)), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-11-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-11-LTLFireability-10 finished in 4823 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((F(p0)||G(p1)))||(p2 U p3)))'
Support contains 7 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 58 transition count 111
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 58 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 58 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 53 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 53 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 52 place count 53 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 51 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 51 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 51 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 50 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 50 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 50 transition count 77
Applied a total of 64 rules in 8 ms. Remains 50 /74 variables (removed 24) and now considering 77/142 (removed 65) transitions.
[2024-05-23 19:03:32] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 50 cols
[2024-05-23 19:03:32] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:03:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-23 19:03:32] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-23 19:03:32] [INFO ] Invariant cache hit.
[2024-05-23 19:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:03:32] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-23 19:03:32] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-23 19:03:32] [INFO ] Invariant cache hit.
[2024-05-23 19:03:32] [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, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-23 19:03:32] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:03:33] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:03:33] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 73/123 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 63 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1209 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 73/123 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 76/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 141 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1894 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 3120ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3121ms
Starting structural reductions in LTL mode, iteration 1 : 50/74 places, 77/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3215 ms. Remains : 50/74 places, 77/142 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 17 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-11-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-11-LTLFireability-11 finished in 3677 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(F((p0||X(X(X(F(p1))))))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 59 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 59 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 59 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 54 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 54 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 50 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 53 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 53 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 55 place count 53 transition count 87
Applied a total of 55 rules in 5 ms. Remains 53 /74 variables (removed 21) and now considering 87/142 (removed 55) transitions.
[2024-05-23 19:03:36] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 53 cols
[2024-05-23 19:03:36] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 19:03:36] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 19:03:36] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-05-23 19:03:36] [INFO ] Invariant cache hit.
[2024-05-23 19:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:03:36] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-23 19:03:36] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-05-23 19:03:36] [INFO ] Invariant cache hit.
[2024-05-23 19:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 83/136 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 1/137 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 66 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 83/136 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 86/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 1/137 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 159 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2666 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 10/10 constraints]
After SMT, in 4195ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 4196ms
Starting structural reductions in LTL mode, iteration 1 : 53/74 places, 87/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4299 ms. Remains : 53/74 places, 87/142 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-11-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-11-LTLFireability-12 finished in 4750 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' '!((p0 U G((F(!p1)&&(!p0||X(p2))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 61 transition count 117
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 61 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 61 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 59 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 59 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 59 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 58 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 58 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 58 transition count 103
Applied a total of 39 rules in 4 ms. Remains 58 /74 variables (removed 16) and now considering 103/142 (removed 39) transitions.
[2024-05-23 19:03:41] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
// Phase 1: matrix 100 rows 58 cols
[2024-05-23 19:03:41] [INFO ] Computed 9 invariants in 9 ms
[2024-05-23 19:03:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-23 19:03:41] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-23 19:03:41] [INFO ] Invariant cache hit.
[2024-05-23 19:03:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:03:41] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-23 19:03:41] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-23 19:03:41] [INFO ] Invariant cache hit.
[2024-05-23 19:03:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:03:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:03:41] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-23 19:03:41] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:03:41] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:03:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:03:41] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:03:41] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:03:41] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:03:41] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 99/157 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:03:42] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:03:42] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:03:42] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/158 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 80 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2690 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 99/157 variables, 58/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 102/182 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/158 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 183 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3302 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 13/13 constraints]
After SMT, in 6019ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6020ms
Starting structural reductions in LTL mode, iteration 1 : 58/74 places, 103/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6127 ms. Remains : 58/74 places, 103/142 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (NOT p2), true]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-14
Product exploration explored 100000 steps with 39 reset in 63 ms.
Product exploration explored 100000 steps with 15 reset in 58 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/58 stabilizing places and 6/103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 265 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
RANDOM walk for 40000 steps (2682 resets) in 132 ms. (300 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (388 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
[2024-05-23 19:03:48] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-23 19:03:48] [INFO ] Invariant cache hit.
[2024-05-23 19:03:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/58 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:03:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:03:48] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 99/157 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:03:48] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/158 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:03:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/158 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:03:48] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-23 19:03:48] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/58 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 99/157 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/158 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/158 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 398ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 13 factoid took 472 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Stuttering acceptance computed with spot in 209 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-23 19:03:49] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-23 19:03:49] [INFO ] Invariant cache hit.
[2024-05-23 19:03:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-23 19:03:49] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-23 19:03:49] [INFO ] Invariant cache hit.
[2024-05-23 19:03:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:03:49] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-23 19:03:49] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-23 19:03:49] [INFO ] Invariant cache hit.
[2024-05-23 19:03:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 99/157 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/158 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 80 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2798 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:03:52] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 99/157 variables, 58/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 102/182 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/158 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 183 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3280 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 13/13 constraints]
After SMT, in 6111ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6112ms
Finished structural reductions in LTL mode , in 1 iterations and 6210 ms. Remains : 58/58 places, 103/103 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/58 stabilizing places and 6/103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 173 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
RANDOM walk for 39243 steps (2652 resets) in 72 ms. (537 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 287 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Stuttering acceptance computed with spot in 193 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Stuttering acceptance computed with spot in 198 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Product exploration explored 100000 steps with 13 reset in 58 ms.
Product exploration explored 100000 steps with 29 reset in 55 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 183 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 103/103 transitions.
Graph (trivial) has 51 edges and 58 vertex of which 10 / 58 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 52 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 52 transition count 96
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 52 transition count 95
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 52 transition count 141
Deduced a syphon composed of 6 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 52 transition count 140
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 16 ms. Remains 52 /58 variables (removed 6) and now considering 140/103 (removed -37) transitions.
[2024-05-23 19:03:57] [INFO ] Redundant transitions in 15 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-23 19:03:57] [INFO ] Flow matrix only has 126 transitions (discarded 14 similar events)
// Phase 1: matrix 126 rows 52 cols
[2024-05-23 19:03:57] [INFO ] Computed 9 invariants in 3 ms
[2024-05-23 19:03:57] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-23 19:03:57] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-23 19:03:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:03:57] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:03:57] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-23 19:03:57] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:03:57] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 15/24 constraints. Problems are: Problem set: 12 solved, 112 unsolved
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/25 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/25 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 125/177 variables, 52/77 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 19/96 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/96 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 1/178 variables, 1/97 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/97 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 0/97 constraints. Problems are: Problem set: 12 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 97 constraints, problems are : Problem set: 12 solved, 112 unsolved in 2804 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 12 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 7/52 variables, 9/9 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 16/25 constraints. Problems are: Problem set: 12 solved, 112 unsolved
[2024-05-23 19:04:00] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:04:00] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/27 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/27 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 125/177 variables, 52/79 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 19/98 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 112/210 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/210 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/211 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/211 constraints. Problems are: Problem set: 12 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/211 constraints. Problems are: Problem set: 12 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 211 constraints, problems are : Problem set: 12 solved, 112 unsolved in 4398 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 112/124 constraints, Known Traps: 18/18 constraints]
After SMT, in 7279ms problems are : Problem set: 12 solved, 112 unsolved
Search for dead transitions found 12 dead transitions in 7282ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 52/58 places, 128/103 transitions.
Graph (complete) has 216 edges and 52 vertex of which 46 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 46 /52 variables (removed 6) and now considering 128/128 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/58 places, 128/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7324 ms. Remains : 46/58 places, 128/103 transitions.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 103/103 transitions.
Applied a total of 0 rules in 0 ms. Remains 58 /58 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-23 19:04:04] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
// Phase 1: matrix 100 rows 58 cols
[2024-05-23 19:04:04] [INFO ] Computed 9 invariants in 8 ms
[2024-05-23 19:04:04] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-23 19:04:04] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-23 19:04:04] [INFO ] Invariant cache hit.
[2024-05-23 19:04:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:04:04] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-23 19:04:04] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-23 19:04:04] [INFO ] Invariant cache hit.
[2024-05-23 19:04:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 99/157 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:04:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:04:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:04:06] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/158 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 80 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2744 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-23 19:04:07] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 99/157 variables, 58/80 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 102/182 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/158 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 183 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3400 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 13/13 constraints]
After SMT, in 6180ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6181ms
Finished structural reductions in LTL mode , in 1 iterations and 6287 ms. Remains : 58/58 places, 103/103 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-14 finished in 29928 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((X(p0)&&G((p1||G((p2||F(p3))))))))'
Found a Shortening insensitive property : HealthRecord-PT-11-LTLFireability-02
Stuttering acceptance computed with spot in 590 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 7 out of 74 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Graph (trivial) has 70 edges and 74 vertex of which 10 / 74 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 55 transition count 111
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 55 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 55 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 52 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 52 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 40 place count 52 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 51 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 51 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 50 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 50 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 47 place count 50 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 49 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 49 transition count 88
Applied a total of 50 rules in 10 ms. Remains 49 /74 variables (removed 25) and now considering 88/142 (removed 54) transitions.
[2024-05-23 19:04:11] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
// Phase 1: matrix 81 rows 49 cols
[2024-05-23 19:04:11] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:04:11] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 19:04:11] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-23 19:04:11] [INFO ] Invariant cache hit.
[2024-05-23 19:04:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:04:11] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-23 19:04:11] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-23 19:04:11] [INFO ] Invariant cache hit.
[2024-05-23 19:04:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 62 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1329 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 74/135 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:04:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 137 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1875 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints]
After SMT, in 3230ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3231ms
Starting structural reductions in LI_LTL mode, iteration 1 : 49/74 places, 88/142 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3325 ms. Remains : 49/74 places, 88/142 transitions.
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-02
Product exploration explored 100000 steps with 17 reset in 51 ms.
Product exploration explored 100000 steps with 32 reset in 58 ms.
Computed a total of 12 stabilizing places and 14 stable transitions
Computed a total of 12 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 196 ms. Reduced automaton from 12 states, 50 edges and 4 AP (stutter sensitive) to 11 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 544 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (3678 resets) in 148 ms. (268 steps per ms) remains 11/15 properties
BEST_FIRST walk for 40004 steps (447 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (456 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (456 resets) in 30 ms. (1290 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (452 resets) in 30 ms. (1290 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (453 resets) in 27 ms. (1428 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (463 resets) in 29 ms. (1333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (453 resets) in 30 ms. (1290 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (449 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (453 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (445 resets) in 29 ms. (1333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (456 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
[2024-05-23 19:04:16] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-23 19:04:16] [INFO ] Invariant cache hit.
[2024-05-23 19:04:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem apf10 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/37 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/49 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/58 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/59 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 59 constraints, problems are : Problem set: 2 solved, 9 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 30/37 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-23 19:04:16] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem apf9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/49 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 80/129 variables, 49/59 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 8/67 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/67 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/68 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 68 constraints, problems are : Problem set: 3 solved, 8 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 441ms problems are : Problem set: 3 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 647 ms.
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 88/88 transitions.
Graph (complete) has 180 edges and 49 vertex of which 32 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 32 transition count 52
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 24 place count 32 transition count 49
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 33 place count 26 transition count 49
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 12 edges and 26 vertex of which 3 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 24 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 24 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 40 place count 24 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 21 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 20 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 19 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 19 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 19 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 19 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 18 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 18 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 18 transition count 31
Applied a total of 59 rules in 6 ms. Remains 18 /49 variables (removed 31) and now considering 31/88 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 18/49 places, 31/88 transitions.
RANDOM walk for 40000 steps (6467 resets) in 105 ms. (377 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (4000 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4445 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4432 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
// Phase 1: matrix 31 rows 18 cols
[2024-05-23 19:04:17] [INFO ] Computed 2 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/39 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/48 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/49 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/49 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 20 constraints, problems are : Problem set: 0 solved, 3 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/39 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/48 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/49 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 23 constraints, problems are : Problem set: 0 solved, 3 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 311 steps, including 102 resets, run visited all 3 properties in 8 ms. (steps per millisecond=38 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 7 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (G (OR p0 p1 (NOT p2) p3)), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 p1 p2 p3))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p1 p2 p3))), (F (NOT (AND (OR (NOT p1) p3) (OR (NOT p2) p3)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p3)), (F (NOT (AND (OR p0 (NOT p1) p3) (OR p0 (NOT p2) p3))))]
Knowledge based reduction with 30 factoid took 711 ms. Reduced automaton from 11 states, 43 edges and 4 AP (stutter sensitive) to 10 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 508 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 498 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 88/88 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-23 19:04:19] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
// Phase 1: matrix 81 rows 49 cols
[2024-05-23 19:04:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:04:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 19:04:19] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-23 19:04:19] [INFO ] Invariant cache hit.
[2024-05-23 19:04:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:04:19] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-23 19:04:19] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-23 19:04:19] [INFO ] Invariant cache hit.
[2024-05-23 19:04:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:04:19] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-23 19:04:19] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:04:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 62 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1412 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 74/135 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:04:21] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 137 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1865 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints]
After SMT, in 3303ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3304ms
Finished structural reductions in LTL mode , in 1 iterations and 3402 ms. Remains : 49/49 places, 88/88 transitions.
Computed a total of 12 stabilizing places and 14 stable transitions
Computed a total of 12 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 158 ms. Reduced automaton from 10 states, 34 edges and 4 AP (stutter sensitive) to 10 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 478 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (3679 resets) in 122 ms. (325 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (452 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (458 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (450 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (451 resets) in 21 ms. (1818 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (437 resets) in 25 ms. (1538 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (457 resets) in 26 ms. (1481 steps per ms) remains 6/6 properties
[2024-05-23 19:04:23] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-23 19:04:23] [INFO ] Invariant cache hit.
[2024-05-23 19:04:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 30/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/49 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 59 constraints, problems are : Problem set: 0 solved, 6 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 30/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 19:04:23] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:04:23] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:04:23] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:04:23] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 12/49 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 80/129 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 69 constraints, problems are : Problem set: 0 solved, 6 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 427ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 239 ms.
Support contains 5 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 88/88 transitions.
Graph (complete) has 180 edges and 49 vertex of which 32 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 32 transition count 50
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 26 place count 32 transition count 47
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 35 place count 26 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 13 edges and 26 vertex of which 3 / 26 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 24 transition count 44
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 24 transition count 41
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 42 place count 24 transition count 38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 21 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 19 transition count 36
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 19 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 18 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 18 transition count 34
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 57 place count 18 transition count 31
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 59 place count 17 transition count 30
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 62 place count 17 transition count 27
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 5 with 2 rules applied. Total rules applied 64 place count 16 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 65 place count 16 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 69 place count 16 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 71 place count 15 transition count 20
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 72 place count 15 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 73 place count 15 transition count 19
Applied a total of 73 rules in 17 ms. Remains 15 /49 variables (removed 34) and now considering 19/88 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 15/49 places, 19/88 transitions.
RANDOM walk for 35466 steps (5707 resets) in 50 ms. (695 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p3 p0))), (F (NOT (OR p1 p2 p3))), (F (NOT (AND (OR (NOT p1) p3) (OR (NOT p2) p3)))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 482 ms. Reduced automaton from 10 states, 34 edges and 4 AP (stutter sensitive) to 10 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 487 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 580 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 522 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 4 reset in 51 ms.
Product exploration explored 100000 steps with 3 reset in 65 ms.
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 88/88 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-23 19:04:26] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-23 19:04:26] [INFO ] Invariant cache hit.
[2024-05-23 19:04:26] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-23 19:04:26] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-23 19:04:26] [INFO ] Invariant cache hit.
[2024-05-23 19:04:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:04:26] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-23 19:04:26] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-23 19:04:26] [INFO ] Invariant cache hit.
[2024-05-23 19:04:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:04:26] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-23 19:04:26] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:04:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 1/130 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 62 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1398 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 7/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 74/135 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-23 19:04:28] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/130 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 137 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1879 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints]
After SMT, in 3309ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3310ms
Finished structural reductions in LTL mode , in 1 iterations and 3491 ms. Remains : 49/49 places, 88/88 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-02 finished in 18884 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)))'
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))))'
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' '!((p0 U G((F(!p1)&&(!p0||X(p2))))))'
Found a Lengthening insensitive property : HealthRecord-PT-11-LTLFireability-14
Stuttering acceptance computed with spot in 225 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (NOT p2), true]
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Graph (trivial) has 79 edges and 74 vertex of which 10 / 74 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 58 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 58 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 58 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 56 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 56 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 56 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 55 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 55 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 55 transition count 102
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 40 place count 53 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 53 transition count 99
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 51 place count 48 transition count 126
Applied a total of 51 rules in 14 ms. Remains 48 /74 variables (removed 26) and now considering 126/142 (removed 16) transitions.
[2024-05-23 19:04:30] [INFO ] Flow matrix only has 115 transitions (discarded 11 similar events)
// Phase 1: matrix 115 rows 48 cols
[2024-05-23 19:04:30] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 19:04:30] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 19:04:30] [INFO ] Flow matrix only has 115 transitions (discarded 11 similar events)
[2024-05-23 19:04:30] [INFO ] Invariant cache hit.
[2024-05-23 19:04:30] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-23 19:04:30] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-23 19:04:30] [INFO ] Flow matrix only has 115 transitions (discarded 11 similar events)
[2024-05-23 19:04:30] [INFO ] Invariant cache hit.
[2024-05-23 19:04:30] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:31] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:04:31] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:04:31] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:04:31] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-23 19:04:31] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:31] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 114/162 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 82 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2290 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:33] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 114/162 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 110/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:34] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 1/163 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 195 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5335 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 9/9 constraints]
After SMT, in 7684ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 7685ms
Starting structural reductions in LI_LTL mode, iteration 1 : 48/74 places, 126/142 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8087 ms. Remains : 48/74 places, 126/142 transitions.
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 64 ms.
Product exploration explored 100000 steps with 47 reset in 55 ms.
Computed a total of 18 stabilizing places and 45 stable transitions
Computed a total of 18 stabilizing places and 45 stable transitions
Detected a total of 18/48 stabilizing places and 45/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 252 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
RANDOM walk for 40000 steps (5366 resets) in 86 ms. (459 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 13 factoid took 355 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Stuttering acceptance computed with spot in 164 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-23 19:04:39] [INFO ] Flow matrix only has 115 transitions (discarded 11 similar events)
[2024-05-23 19:04:39] [INFO ] Invariant cache hit.
[2024-05-23 19:04:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 19:04:39] [INFO ] Flow matrix only has 115 transitions (discarded 11 similar events)
[2024-05-23 19:04:39] [INFO ] Invariant cache hit.
[2024-05-23 19:04:39] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-23 19:04:39] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-23 19:04:39] [INFO ] Flow matrix only has 115 transitions (discarded 11 similar events)
[2024-05-23 19:04:39] [INFO ] Invariant cache hit.
[2024-05-23 19:04:39] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 114/162 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 82 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2217 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 114/162 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 110/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:43] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 1/163 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 195 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5180 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 9/9 constraints]
After SMT, in 7457ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 7459ms
Finished structural reductions in LTL mode , in 1 iterations and 7558 ms. Remains : 48/48 places, 126/126 transitions.
Computed a total of 18 stabilizing places and 45 stable transitions
Computed a total of 18 stabilizing places and 45 stable transitions
Detected a total of 18/48 stabilizing places and 45/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 159 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
RANDOM walk for 40000 steps (5414 resets) in 119 ms. (333 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Stuttering acceptance computed with spot in 204 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Stuttering acceptance computed with spot in 197 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Product exploration explored 100000 steps with 29 reset in 57 ms.
Product exploration explored 100000 steps with 15 reset in 55 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 187 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 126/126 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 48 transition count 113
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 48 transition count 133
Deduced a syphon composed of 2 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 48 transition count 132
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 16 rules in 16 ms. Remains 48 /48 variables (removed 0) and now considering 132/126 (removed -6) transitions.
[2024-05-23 19:04:49] [INFO ] Redundant transitions in 15 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-23 19:04:49] [INFO ] Flow matrix only has 118 transitions (discarded 14 similar events)
// Phase 1: matrix 118 rows 48 cols
[2024-05-23 19:04:49] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 19:04:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-23 19:04:49] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:04:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:04:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:04:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-23 19:04:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-23 19:04:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:04:49] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:04:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-23 19:04:49] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:04:49] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 10/19 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 117/165 variables, 48/67 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 19/86 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/86 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 1/166 variables, 1/87 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/87 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/166 variables, 0/87 constraints. Problems are: Problem set: 4 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 87 constraints, problems are : Problem set: 4 solved, 112 unsolved in 2924 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 4 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 3/48 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 10/19 constraints. Problems are: Problem set: 4 solved, 112 unsolved
[2024-05-23 19:04:52] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:04:52] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/21 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 117/165 variables, 48/69 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 19/88 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 112/200 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/200 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 1/166 variables, 1/201 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/201 constraints. Problems are: Problem set: 4 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/201 constraints. Problems are: Problem set: 4 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 201 constraints, problems are : Problem set: 4 solved, 112 unsolved in 4036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 112/116 constraints, Known Traps: 12/12 constraints]
After SMT, in 7043ms problems are : Problem set: 4 solved, 112 unsolved
Search for dead transitions found 4 dead transitions in 7044ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 48/48 places, 128/126 transitions.
Graph (complete) has 216 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 46 /48 variables (removed 2) and now considering 128/128 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/48 places, 128/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7081 ms. Remains : 46/48 places, 128/126 transitions.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-23 19:04:56] [INFO ] Flow matrix only has 115 transitions (discarded 11 similar events)
// Phase 1: matrix 115 rows 48 cols
[2024-05-23 19:04:56] [INFO ] Computed 9 invariants in 0 ms
[2024-05-23 19:04:56] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-23 19:04:56] [INFO ] Flow matrix only has 115 transitions (discarded 11 similar events)
[2024-05-23 19:04:56] [INFO ] Invariant cache hit.
[2024-05-23 19:04:56] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-23 19:04:56] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-23 19:04:56] [INFO ] Flow matrix only has 115 transitions (discarded 11 similar events)
[2024-05-23 19:04:56] [INFO ] Invariant cache hit.
[2024-05-23 19:04:56] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:56] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:04:56] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:04:56] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:04:56] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:04:56] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:57] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 114/162 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 82 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2328 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:59] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 114/162 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 110/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:04:59] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-23 19:05:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 1/163 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 195 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5147 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 9/9 constraints]
After SMT, in 7526ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 7528ms
Finished structural reductions in LTL mode , in 1 iterations and 7655 ms. Remains : 48/48 places, 126/126 transitions.
Treatment of property HealthRecord-PT-11-LTLFireability-14 finished in 33837 ms.
[2024-05-23 19:05:03] [INFO ] Flatten gal took : 8 ms
[2024-05-23 19:05:03] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 19:05:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 142 transitions and 452 arcs took 4 ms.
Total runtime 166543 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-11

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/423/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 74
TRANSITIONS: 142
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/423/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3219
MODEL NAME: /home/mcc/execution/423/model
74 places, 142 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA HealthRecord-PT-11-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-11-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-11-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-11-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716491105487

--------------------
content from stderr:

+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is HealthRecord-PT-11, 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 r179-tall-171640602300780"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-11.tgz
mv HealthRecord-PT-11 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 ;