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.r496-tall-171640604300828.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 ltsminxred
Input is HealthRecord-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604300828
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:21 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 175K 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-17-LTLFireability-00
FORMULA_NAME HealthRecord-PT-17-LTLFireability-01
FORMULA_NAME HealthRecord-PT-17-LTLFireability-02
FORMULA_NAME HealthRecord-PT-17-LTLFireability-03
FORMULA_NAME HealthRecord-PT-17-LTLFireability-04
FORMULA_NAME HealthRecord-PT-17-LTLFireability-05
FORMULA_NAME HealthRecord-PT-17-LTLFireability-06
FORMULA_NAME HealthRecord-PT-17-LTLFireability-07
FORMULA_NAME HealthRecord-PT-17-LTLFireability-08
FORMULA_NAME HealthRecord-PT-17-LTLFireability-09
FORMULA_NAME HealthRecord-PT-17-LTLFireability-10
FORMULA_NAME HealthRecord-PT-17-LTLFireability-11
FORMULA_NAME HealthRecord-PT-17-LTLFireability-12
FORMULA_NAME HealthRecord-PT-17-LTLFireability-13
FORMULA_NAME HealthRecord-PT-17-LTLFireability-14
FORMULA_NAME HealthRecord-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717201863192

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:31:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:31:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:31:04] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-06-01 00:31:04] [INFO ] Transformed 624 places.
[2024-06-01 00:31:04] [INFO ] Transformed 828 transitions.
[2024-06-01 00:31:04] [INFO ] Found NUPN structural information;
[2024-06-01 00:31:04] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HealthRecord-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 124 places :
Symmetric choice reduction at 0 with 124 rule applications. Total rules 124 place count 500 transition count 681
Iterating global reduction 0 with 124 rules applied. Total rules applied 248 place count 500 transition count 681
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 299 place count 449 transition count 619
Iterating global reduction 0 with 51 rules applied. Total rules applied 350 place count 449 transition count 619
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 357 place count 449 transition count 612
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 379 place count 427 transition count 576
Iterating global reduction 1 with 22 rules applied. Total rules applied 401 place count 427 transition count 576
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 415 place count 413 transition count 554
Iterating global reduction 1 with 14 rules applied. Total rules applied 429 place count 413 transition count 554
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 431 place count 411 transition count 548
Iterating global reduction 1 with 2 rules applied. Total rules applied 433 place count 411 transition count 548
Applied a total of 433 rules in 134 ms. Remains 411 /624 variables (removed 213) and now considering 548/828 (removed 280) transitions.
// Phase 1: matrix 548 rows 411 cols
[2024-06-01 00:31:04] [INFO ] Computed 18 invariants in 25 ms
[2024-06-01 00:31:05] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 00:31:05] [INFO ] Invariant cache hit.
[2024-06-01 00:31:05] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 547 sub problems to find dead transitions.
[2024-06-01 00:31:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 00:31:12] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 25 ms to minimize.
[2024-06-01 00:31:13] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 3 ms to minimize.
[2024-06-01 00:31:13] [INFO ] Deduced a trap composed of 222 places in 124 ms of which 3 ms to minimize.
[2024-06-01 00:31:13] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 3 ms to minimize.
[2024-06-01 00:31:13] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-06-01 00:31:13] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 2 ms to minimize.
[2024-06-01 00:31:13] [INFO ] Deduced a trap composed of 219 places in 111 ms of which 3 ms to minimize.
[2024-06-01 00:31:13] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-06-01 00:31:14] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-06-01 00:31:14] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 2 ms to minimize.
[2024-06-01 00:31:14] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-06-01 00:31:14] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:31:14] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:31:14] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 145 places in 117 ms of which 3 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:31:15] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 00:31:19] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-06-01 00:31:19] [INFO ] Deduced a trap composed of 119 places in 104 ms of which 2 ms to minimize.
[2024-06-01 00:31:20] [INFO ] Deduced a trap composed of 147 places in 115 ms of which 3 ms to minimize.
[2024-06-01 00:31:20] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-06-01 00:31:20] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:31:21] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:31:21] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:31:21] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:31:22] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:31:23] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:31:23] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:31:24] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:31:24] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:31:25] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:31:25] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:31:25] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 00:31:26] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-06-01 00:31:26] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-06-01 00:31:26] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 3 ms to minimize.
[2024-06-01 00:31:26] [INFO ] Deduced a trap composed of 139 places in 120 ms of which 3 ms to minimize.
[2024-06-01 00:31:27] [INFO ] Deduced a trap composed of 108 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:31:27] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:31:27] [INFO ] Deduced a trap composed of 120 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:31:28] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:31:28] [INFO ] Deduced a trap composed of 106 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:31:28] [INFO ] Deduced a trap composed of 105 places in 64 ms of which 2 ms to minimize.
[2024-06-01 00:31:28] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 2 ms to minimize.
[2024-06-01 00:31:28] [INFO ] Deduced a trap composed of 109 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:31:28] [INFO ] Deduced a trap composed of 106 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:31:28] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:31:29] [INFO ] Deduced a trap composed of 110 places in 83 ms of which 3 ms to minimize.
[2024-06-01 00:31:29] [INFO ] Deduced a trap composed of 107 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:31:29] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 2 ms to minimize.
[2024-06-01 00:31:30] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 3 ms to minimize.
[2024-06-01 00:31:30] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:31:30] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 00:31:31] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 3 ms to minimize.
[2024-06-01 00:31:33] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:31:33] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:31:33] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:31:33] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:31:34] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:31:34] [INFO ] Deduced a trap composed of 120 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:31:34] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:31:34] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:31:35] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-06-01 00:31:35] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:31:35] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/959 variables, and 86 constraints, problems are : Problem set: 0 solved, 547 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/411 constraints, PredecessorRefiner: 547/547 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 547 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 68/86 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 00:31:39] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:31:39] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 2 ms to minimize.
[2024-06-01 00:31:40] [INFO ] Deduced a trap composed of 145 places in 117 ms of which 2 ms to minimize.
[2024-06-01 00:31:40] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 2 ms to minimize.
[2024-06-01 00:31:40] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-06-01 00:31:41] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-06-01 00:31:41] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:31:41] [INFO ] Deduced a trap composed of 107 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 109 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 108 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 110 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 109 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 111 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:31:43] [INFO ] Deduced a trap composed of 110 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:31:43] [INFO ] Deduced a trap composed of 112 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:31:43] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 2 ms to minimize.
[2024-06-01 00:31:44] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:31:45] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 00:31:46] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:31:46] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:31:46] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:31:49] [INFO ] Deduced a trap composed of 114 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:31:50] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:31:50] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 00:31:53] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:31:54] [INFO ] Deduced a trap composed of 109 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:31:54] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:31:54] [INFO ] Deduced a trap composed of 110 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:31:54] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:31:55] [INFO ] Deduced a trap composed of 111 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:31:55] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:31:55] [INFO ] Deduced a trap composed of 112 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:31:55] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 00:31:58] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 2 ms to minimize.
[2024-06-01 00:32:01] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:32:05] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/959 variables, and 123 constraints, problems are : Problem set: 0 solved, 547 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/411 constraints, PredecessorRefiner: 0/547 constraints, Known Traps: 105/105 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 547 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 411/624 places, 548/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60992 ms. Remains : 411/624 places, 548/828 transitions.
Support contains 33 out of 411 places after structural reductions.
[2024-06-01 00:32:05] [INFO ] Flatten gal took : 55 ms
[2024-06-01 00:32:06] [INFO ] Flatten gal took : 28 ms
[2024-06-01 00:32:06] [INFO ] Input system was already deterministic with 548 transitions.
Support contains 31 out of 411 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (349 resets) in 1495 ms. (26 steps per ms) remains 20/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
[2024-06-01 00:32:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 110/134 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 277/411 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 113 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:32:07] [INFO ] Deduced a trap composed of 107 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:32:08] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 548/959 variables, 411/439 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 00:32:08] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/959 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/959 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/959 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 959/959 variables, and 440 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2704 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 110/134 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 00:32:09] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:32:09] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 277/411 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 00:32:09] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 2 ms to minimize.
[2024-06-01 00:32:09] [INFO ] Deduced a trap composed of 95 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 96 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 3 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 109 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:32:11] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:32:11] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:32:11] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:32:11] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 548/959 variables, 411/458 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/959 variables, 20/478 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 00:32:12] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 3 ms to minimize.
[2024-06-01 00:32:12] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/959 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/959 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 00:32:13] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/959 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/959 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 00:32:14] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 959/959 variables, and 482 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 33/33 constraints]
After SMT, in 7728ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 548/548 transitions.
Graph (trivial) has 430 edges and 411 vertex of which 78 / 411 are part of one of the 21 SCC in 6 ms
Free SCC test removed 57 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 790 edges and 354 vertex of which 318 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 199 rules applied. Total rules applied 201 place count 318 transition count 246
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 146 rules applied. Total rules applied 347 place count 183 transition count 235
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 10 rules applied. Total rules applied 357 place count 177 transition count 231
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 361 place count 173 transition count 231
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 361 place count 173 transition count 213
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 397 place count 155 transition count 213
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 422 place count 130 transition count 187
Iterating global reduction 4 with 25 rules applied. Total rules applied 447 place count 130 transition count 187
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 447 place count 130 transition count 181
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 459 place count 124 transition count 181
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 461 place count 122 transition count 179
Iterating global reduction 4 with 2 rules applied. Total rules applied 463 place count 122 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 465 place count 122 transition count 177
Performed 29 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 523 place count 93 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 527 place count 93 transition count 139
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 531 place count 89 transition count 135
Iterating global reduction 6 with 4 rules applied. Total rules applied 535 place count 89 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 539 place count 87 transition count 133
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 540 place count 86 transition count 132
Iterating global reduction 6 with 1 rules applied. Total rules applied 541 place count 86 transition count 132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 545 place count 84 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 558 place count 84 transition count 143
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 579 place count 84 transition count 122
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 600 place count 63 transition count 122
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 602 place count 63 transition count 122
Applied a total of 602 rules in 72 ms. Remains 63 /411 variables (removed 348) and now considering 122/548 (removed 426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 63/411 places, 122/548 transitions.
RANDOM walk for 40000 steps (3514 resets) in 583 ms. (68 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40004 steps (598 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (577 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (583 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (595 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (568 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (580 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
[2024-06-01 00:32:14] [INFO ] Flow matrix only has 101 transitions (discarded 21 similar events)
// Phase 1: matrix 101 rows 63 cols
[2024-06-01 00:32:14] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 00:32:14] [INFO ] State equation strengthened by 23 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) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/19 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 40/59 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 64/123 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 39/162 variables, 23/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/164 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/164 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 91 constraints, problems are : Problem set: 0 solved, 6 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 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) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/19 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 40/59 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 64/123 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 39/162 variables, 23/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/164 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/164 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 97 constraints, problems are : Problem set: 0 solved, 6 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 358ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 353 steps, including 42 resets, run visited all 6 properties in 8 ms. (steps per millisecond=44 )
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 6 properties in 13 ms.
FORMULA HealthRecord-PT-17-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 111 stabilizing places and 119 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Graph (trivial) has 475 edges and 411 vertex of which 78 / 411 are part of one of the 21 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 353 transition count 335
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 160 rules applied. Total rules applied 307 place count 207 transition count 321
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 314 place count 200 transition count 321
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 314 place count 200 transition count 315
Deduced a syphon composed of 6 places in 9 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 326 place count 194 transition count 315
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 355 place count 165 transition count 265
Iterating global reduction 3 with 29 rules applied. Total rules applied 384 place count 165 transition count 265
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 390 place count 165 transition count 259
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 396 place count 159 transition count 259
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 407 place count 148 transition count 241
Iterating global reduction 5 with 11 rules applied. Total rules applied 418 place count 148 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 422 place count 148 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 423 place count 147 transition count 237
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 428 place count 142 transition count 230
Iterating global reduction 7 with 5 rules applied. Total rules applied 433 place count 142 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 436 place count 142 transition count 227
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 439 place count 139 transition count 224
Iterating global reduction 8 with 3 rules applied. Total rules applied 442 place count 139 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 445 place count 139 transition count 221
Performed 53 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 9 with 106 rules applied. Total rules applied 551 place count 86 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 558 place count 86 transition count 157
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 565 place count 79 transition count 143
Iterating global reduction 10 with 7 rules applied. Total rules applied 572 place count 79 transition count 143
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 574 place count 77 transition count 140
Iterating global reduction 10 with 2 rules applied. Total rules applied 576 place count 77 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 582 place count 74 transition count 178
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 583 place count 73 transition count 176
Iterating global reduction 10 with 1 rules applied. Total rules applied 584 place count 73 transition count 176
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 585 place count 72 transition count 172
Iterating global reduction 10 with 1 rules applied. Total rules applied 586 place count 72 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 588 place count 71 transition count 185
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 590 place count 69 transition count 179
Iterating global reduction 10 with 2 rules applied. Total rules applied 592 place count 69 transition count 179
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 593 place count 68 transition count 175
Iterating global reduction 10 with 1 rules applied. Total rules applied 594 place count 68 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 599 place count 68 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 11 with 16 rules applied. Total rules applied 615 place count 68 transition count 154
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 616 place count 67 transition count 151
Iterating global reduction 11 with 1 rules applied. Total rules applied 617 place count 67 transition count 151
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 620 place count 64 transition count 146
Iterating global reduction 11 with 3 rules applied. Total rules applied 623 place count 64 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 625 place count 63 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 636 place count 63 transition count 145
Applied a total of 636 rules in 99 ms. Remains 63 /411 variables (removed 348) and now considering 145/548 (removed 403) transitions.
[2024-06-01 00:32:15] [INFO ] Flow matrix only has 135 transitions (discarded 10 similar events)
// Phase 1: matrix 135 rows 63 cols
[2024-06-01 00:32:15] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 00:32:15] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 00:32:15] [INFO ] Flow matrix only has 135 transitions (discarded 10 similar events)
[2024-06-01 00:32:15] [INFO ] Invariant cache hit.
[2024-06-01 00:32:15] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 00:32:15] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-06-01 00:32:15] [INFO ] Redundant transitions in 20 ms returned []
Running 137 sub problems to find dead transitions.
[2024-06-01 00:32:15] [INFO ] Flow matrix only has 135 transitions (discarded 10 similar events)
[2024-06-01 00:32:15] [INFO ] Invariant cache hit.
[2024-06-01 00:32:15] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-06-01 00:32:16] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:32:16] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 00:32:16] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-06-01 00:32:16] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 134/197 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 23/99 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 1/198 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 100 constraints, problems are : Problem set: 0 solved, 137 unsolved in 3351 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 134/197 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 23/99 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 137/236 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 1/198 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 237 constraints, problems are : Problem set: 0 solved, 137 unsolved in 5275 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 4/4 constraints]
After SMT, in 8722ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 8724ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/411 places, 145/548 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8959 ms. Remains : 63/411 places, 145/548 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-17-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-00 finished in 9170 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))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Graph (trivial) has 475 edges and 411 vertex of which 78 / 411 are part of one of the 21 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 353 transition count 337
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 156 rules applied. Total rules applied 301 place count 209 transition count 325
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 309 place count 203 transition count 323
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 313 place count 201 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 200 transition count 321
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 314 place count 200 transition count 315
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 326 place count 194 transition count 315
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 355 place count 165 transition count 264
Iterating global reduction 5 with 29 rules applied. Total rules applied 384 place count 165 transition count 264
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 5 rules applied. Total rules applied 389 place count 165 transition count 259
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 394 place count 160 transition count 259
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 405 place count 149 transition count 242
Iterating global reduction 7 with 11 rules applied. Total rules applied 416 place count 149 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 420 place count 149 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 421 place count 148 transition count 238
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 426 place count 143 transition count 231
Iterating global reduction 9 with 5 rules applied. Total rules applied 431 place count 143 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 434 place count 143 transition count 228
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 437 place count 140 transition count 225
Iterating global reduction 10 with 3 rules applied. Total rules applied 440 place count 140 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 443 place count 140 transition count 222
Performed 54 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 11 with 108 rules applied. Total rules applied 551 place count 86 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 557 place count 86 transition count 158
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 564 place count 79 transition count 144
Iterating global reduction 12 with 7 rules applied. Total rules applied 571 place count 79 transition count 144
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 573 place count 77 transition count 141
Iterating global reduction 12 with 2 rules applied. Total rules applied 575 place count 77 transition count 141
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 576 place count 76 transition count 137
Iterating global reduction 12 with 1 rules applied. Total rules applied 577 place count 76 transition count 137
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 585 place count 72 transition count 179
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 586 place count 71 transition count 177
Iterating global reduction 12 with 1 rules applied. Total rules applied 587 place count 71 transition count 177
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 588 place count 70 transition count 173
Iterating global reduction 12 with 1 rules applied. Total rules applied 589 place count 70 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 593 place count 70 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 595 place count 69 transition count 181
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 597 place count 67 transition count 175
Iterating global reduction 13 with 2 rules applied. Total rules applied 599 place count 67 transition count 175
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 600 place count 66 transition count 171
Iterating global reduction 13 with 1 rules applied. Total rules applied 601 place count 66 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 606 place count 66 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 14 with 18 rules applied. Total rules applied 624 place count 66 transition count 148
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 625 place count 65 transition count 145
Iterating global reduction 14 with 1 rules applied. Total rules applied 626 place count 65 transition count 145
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 629 place count 62 transition count 140
Iterating global reduction 14 with 3 rules applied. Total rules applied 632 place count 62 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 634 place count 61 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 14 with 11 rules applied. Total rules applied 645 place count 61 transition count 139
Applied a total of 645 rules in 59 ms. Remains 61 /411 variables (removed 350) and now considering 139/548 (removed 409) transitions.
[2024-06-01 00:32:24] [INFO ] Flow matrix only has 128 transitions (discarded 11 similar events)
// Phase 1: matrix 128 rows 61 cols
[2024-06-01 00:32:24] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 00:32:24] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 00:32:24] [INFO ] Flow matrix only has 128 transitions (discarded 11 similar events)
[2024-06-01 00:32:24] [INFO ] Invariant cache hit.
[2024-06-01 00:32:24] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 00:32:24] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-01 00:32:24] [INFO ] Redundant transitions in 22 ms returned []
Running 131 sub problems to find dead transitions.
[2024-06-01 00:32:24] [INFO ] Flow matrix only has 128 transitions (discarded 11 similar events)
[2024-06-01 00:32:24] [INFO ] Invariant cache hit.
[2024-06-01 00:32:24] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-01 00:32:25] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
[2024-06-01 00:32:25] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:32:25] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 127/188 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 22/95 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 1/189 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 96 constraints, problems are : Problem set: 0 solved, 131 unsolved in 3262 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-01 00:32:28] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:32:28] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 127/188 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 22/97 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 131/228 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 1/189 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 229 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5332 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints]
After SMT, in 8688ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 8689ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/411 places, 139/548 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8876 ms. Remains : 61/411 places, 139/548 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-01 finished in 8920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||X((p1||G(p2)))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 526
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 526
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 389 transition count 513
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 389 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 384 transition count 506
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 384 transition count 506
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 378 transition count 497
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 378 transition count 497
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 372 transition count 488
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 372 transition count 488
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 366 transition count 482
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 366 transition count 482
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 363 transition count 479
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 363 transition count 479
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 99 place count 363 transition count 476
Applied a total of 99 rules in 51 ms. Remains 363 /411 variables (removed 48) and now considering 476/548 (removed 72) transitions.
// Phase 1: matrix 476 rows 363 cols
[2024-06-01 00:32:33] [INFO ] Computed 18 invariants in 3 ms
[2024-06-01 00:32:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 00:32:33] [INFO ] Invariant cache hit.
[2024-06-01 00:32:33] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 475 sub problems to find dead transitions.
[2024-06-01 00:32:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 00:32:39] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 3 ms to minimize.
[2024-06-01 00:32:39] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-06-01 00:32:39] [INFO ] Deduced a trap composed of 192 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:32:39] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:32:40] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 3 ms to minimize.
[2024-06-01 00:32:41] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:32:41] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:32:41] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:32:41] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:32:42] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:32:42] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:32:42] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:32:42] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:32:42] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:32:42] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-06-01 00:32:42] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:32:43] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:32:44] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:32:44] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:32:44] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 00:32:47] [INFO ] Deduced a trap composed of 139 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:32:47] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:32:47] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 2 ms to minimize.
[2024-06-01 00:32:47] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:32:48] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:32:48] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:32:48] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:32:48] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:32:48] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 2 ms to minimize.
[2024-06-01 00:32:49] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:32:49] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:32:49] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 00:32:51] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:32:51] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:32:51] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:32:52] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 00:32:56] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:32:56] [INFO ] Deduced a trap composed of 135 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:32:56] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:32:56] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:32:57] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:32:57] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:32:57] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:32:57] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:32:57] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:32:58] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:32:58] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 2 ms to minimize.
[2024-06-01 00:32:58] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:32:58] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:32:59] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/839 variables, and 68 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/363 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 475 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 00:33:07] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 00:33:11] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:33:11] [INFO ] Deduced a trap composed of 129 places in 90 ms of which 3 ms to minimize.
[2024-06-01 00:33:11] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:33:12] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:33:12] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 2 ms to minimize.
[2024-06-01 00:33:12] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:33:12] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:33:12] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 00:33:15] [INFO ] Deduced a trap composed of 139 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:33:16] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:33:16] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-06-01 00:33:16] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2024-06-01 00:33:17] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 8 (OVERLAPS) 476/839 variables, 363/445 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 475/920 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 00:33:25] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:33:29] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/839 variables, 2/922 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 839/839 variables, and 922 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 66/66 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 363/411 places, 476/548 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60434 ms. Remains : 363/411 places, 476/548 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-02
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 3 ms.
FORMULA HealthRecord-PT-17-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-02 finished in 60686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(F((p0&&X(F(p1))))))) U G(p2)))'
Support contains 2 out of 411 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 : 411/411 places, 548/548 transitions.
Graph (trivial) has 470 edges and 411 vertex of which 78 / 411 are part of one of the 21 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 353 transition count 338
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 157 rules applied. Total rules applied 301 place count 210 transition count 324
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 310 place count 203 transition count 322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 312 place count 201 transition count 322
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 312 place count 201 transition count 316
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 324 place count 195 transition count 316
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 352 place count 167 transition count 267
Iterating global reduction 4 with 28 rules applied. Total rules applied 380 place count 167 transition count 267
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 386 place count 167 transition count 261
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 392 place count 161 transition count 261
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 404 place count 149 transition count 242
Iterating global reduction 6 with 12 rules applied. Total rules applied 416 place count 149 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 420 place count 149 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 421 place count 148 transition count 238
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 426 place count 143 transition count 231
Iterating global reduction 8 with 5 rules applied. Total rules applied 431 place count 143 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 434 place count 143 transition count 228
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 436 place count 141 transition count 226
Iterating global reduction 9 with 2 rules applied. Total rules applied 438 place count 141 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 440 place count 141 transition count 224
Performed 52 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 10 with 104 rules applied. Total rules applied 544 place count 89 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 550 place count 89 transition count 162
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 557 place count 82 transition count 148
Iterating global reduction 11 with 7 rules applied. Total rules applied 564 place count 82 transition count 148
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 566 place count 80 transition count 145
Iterating global reduction 11 with 2 rules applied. Total rules applied 568 place count 80 transition count 145
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 569 place count 79 transition count 141
Iterating global reduction 11 with 1 rules applied. Total rules applied 570 place count 79 transition count 141
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 576 place count 76 transition count 178
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 577 place count 75 transition count 176
Iterating global reduction 11 with 1 rules applied. Total rules applied 578 place count 75 transition count 176
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 579 place count 74 transition count 172
Iterating global reduction 11 with 1 rules applied. Total rules applied 580 place count 74 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 583 place count 74 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 585 place count 73 transition count 181
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 587 place count 71 transition count 175
Iterating global reduction 12 with 2 rules applied. Total rules applied 589 place count 71 transition count 175
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 590 place count 70 transition count 171
Iterating global reduction 12 with 1 rules applied. Total rules applied 591 place count 70 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 596 place count 70 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 13 with 16 rules applied. Total rules applied 612 place count 70 transition count 150
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 613 place count 69 transition count 147
Iterating global reduction 13 with 1 rules applied. Total rules applied 614 place count 69 transition count 147
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 617 place count 66 transition count 142
Iterating global reduction 13 with 3 rules applied. Total rules applied 620 place count 66 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 622 place count 65 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 625 place count 65 transition count 149
Applied a total of 625 rules in 53 ms. Remains 65 /411 variables (removed 346) and now considering 149/548 (removed 399) transitions.
[2024-06-01 00:33:34] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
// Phase 1: matrix 139 rows 65 cols
[2024-06-01 00:33:34] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:33:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 00:33:34] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-06-01 00:33:34] [INFO ] Invariant cache hit.
[2024-06-01 00:33:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 00:33:34] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-01 00:33:34] [INFO ] Redundant transitions in 20 ms returned []
Running 133 sub problems to find dead transitions.
[2024-06-01 00:33:34] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-06-01 00:33:34] [INFO ] Invariant cache hit.
[2024-06-01 00:33:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-01 00:33:35] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:33:35] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:33:35] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:33:35] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 138/203 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 19/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 1/204 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 98 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3668 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 138/203 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 19/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 133/230 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/204 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 231 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5150 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints]
After SMT, in 8895ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 8897ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/411 places, 149/548 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9086 ms. Remains : 65/411 places, 149/548 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-03
Stuttering criterion allowed to conclude after 21 steps with 1 reset in 3 ms.
FORMULA HealthRecord-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-03 finished in 9204 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((X(X(G(p0)))&&(p1||X(F(p2))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 525
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 525
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 391 transition count 516
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 391 transition count 516
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 386 transition count 508
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 386 transition count 508
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 382 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 382 transition count 501
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 378 transition count 496
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 378 transition count 496
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 374 transition count 491
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 374 transition count 491
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 373 transition count 489
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 373 transition count 489
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 79 place count 373 transition count 486
Applied a total of 79 rules in 36 ms. Remains 373 /411 variables (removed 38) and now considering 486/548 (removed 62) transitions.
// Phase 1: matrix 486 rows 373 cols
[2024-06-01 00:33:43] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 00:33:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 00:33:43] [INFO ] Invariant cache hit.
[2024-06-01 00:33:43] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 485 sub problems to find dead transitions.
[2024-06-01 00:33:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-06-01 00:33:49] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-06-01 00:33:49] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 2 ms to minimize.
[2024-06-01 00:33:49] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 3 ms to minimize.
[2024-06-01 00:33:49] [INFO ] Deduced a trap composed of 169 places in 106 ms of which 3 ms to minimize.
[2024-06-01 00:33:49] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:33:51] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:33:51] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:33:51] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:33:51] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 3 ms to minimize.
[2024-06-01 00:33:51] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2024-06-01 00:33:52] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:33:52] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:33:52] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-06-01 00:33:52] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-06-01 00:33:55] [INFO ] Deduced a trap composed of 136 places in 101 ms of which 2 ms to minimize.
[2024-06-01 00:33:55] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 3 ms to minimize.
[2024-06-01 00:33:56] [INFO ] Deduced a trap composed of 203 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:33:56] [INFO ] Deduced a trap composed of 135 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:33:56] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:33:56] [INFO ] Deduced a trap composed of 136 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:33:56] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
[2024-06-01 00:33:57] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:33:57] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:33:57] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:33:57] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:33:57] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:33:57] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:33:57] [INFO ] Deduced a trap composed of 203 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:33:57] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:33:58] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:33:58] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:33:58] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:33:58] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 3 ms to minimize.
[2024-06-01 00:33:58] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-06-01 00:33:59] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:33:59] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:33:59] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:34:01] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:34:01] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:34:01] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 2 ms to minimize.
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:34:03] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:34:03] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-06-01 00:34:04] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 94 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:34:06] [INFO ] Deduced a trap composed of 95 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:34:06] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:34:06] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:34:06] [INFO ] Deduced a trap composed of 95 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:34:06] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 2 ms to minimize.
[2024-06-01 00:34:06] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 2 ms to minimize.
[2024-06-01 00:34:07] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:34:07] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:34:08] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 2 ms to minimize.
[2024-06-01 00:34:08] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:34:09] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:34:09] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/859 variables, and 91 constraints, problems are : Problem set: 0 solved, 485 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 485/485 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 485 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-06-01 00:34:17] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:34:18] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:34:18] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:34:19] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:34:19] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:34:19] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:34:20] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-06-01 00:34:22] [INFO ] Deduced a trap composed of 135 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:34:22] [INFO ] Deduced a trap composed of 136 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:34:23] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:34:23] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:34:23] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:34:24] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:34:24] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:34:24] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-06-01 00:34:27] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:34:28] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:34:29] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-06-01 00:34:34] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 9 (OVERLAPS) 486/859 variables, 373/483 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/859 variables, 485/968 constraints. Problems are: Problem set: 0 solved, 485 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/859 variables, and 968 constraints, problems are : Problem set: 0 solved, 485 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 485/485 constraints, Known Traps: 92/92 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 485 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 373/411 places, 486/548 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60416 ms. Remains : 373/411 places, 486/548 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-05
Entered a terminal (fully accepting) state of product in 197 steps with 1 reset in 3 ms.
FORMULA HealthRecord-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-05 finished in 60696 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(X(G(p0))))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 526
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 526
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 390 transition count 515
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 390 transition count 515
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 387 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 387 transition count 508
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 383 transition count 504
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 383 transition count 504
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 379 transition count 496
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 379 transition count 496
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 375 transition count 491
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 375 transition count 491
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 371 transition count 486
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 371 transition count 486
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 371 transition count 480
Applied a total of 86 rules in 36 ms. Remains 371 /411 variables (removed 40) and now considering 480/548 (removed 68) transitions.
// Phase 1: matrix 480 rows 371 cols
[2024-06-01 00:34:44] [INFO ] Computed 18 invariants in 6 ms
[2024-06-01 00:34:44] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 00:34:44] [INFO ] Invariant cache hit.
[2024-06-01 00:34:44] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2024-06-01 00:34:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 00:34:49] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-06-01 00:34:50] [INFO ] Deduced a trap composed of 139 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:34:50] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 3 ms to minimize.
[2024-06-01 00:34:50] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 3 ms to minimize.
[2024-06-01 00:34:50] [INFO ] Deduced a trap composed of 209 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:34:50] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 3 ms to minimize.
[2024-06-01 00:34:51] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:34:51] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 2 ms to minimize.
[2024-06-01 00:34:51] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:34:52] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:34:52] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:34:52] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:34:53] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:34:53] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:34:53] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:34:53] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:34:53] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:34:53] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:34:53] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:34:53] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 00:34:56] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:34:56] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 135 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:35:00] [INFO ] Deduced a trap composed of 121 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:35:01] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 00:35:01] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:35:02] [INFO ] Deduced a trap composed of 204 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:35:03] [INFO ] Deduced a trap composed of 131 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:35:03] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:35:04] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 00:35:06] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:35:06] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 2 ms to minimize.
[2024-06-01 00:35:06] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:35:07] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:35:07] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:35:07] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:35:07] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:35:07] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:35:07] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:35:08] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:35:08] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:35:08] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:35:08] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
[2024-06-01 00:35:09] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:35:09] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 00:35:14] [INFO ] Deduced a trap composed of 136 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/851 variables, and 69 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/371 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (OVERLAPS) 1/371 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 51/69 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 00:35:18] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:35:20] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 00:35:22] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:35:22] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:35:22] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:35:23] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
[2024-06-01 00:35:23] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:35:23] [INFO ] Deduced a trap composed of 114 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (OVERLAPS) 480/851 variables, 371/448 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/851 variables, 479/927 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 00:35:36] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-06-01 00:35:37] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/851 variables, 2/929 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/851 variables, and 929 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 371/371 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 61/61 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 371/411 places, 480/548 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60420 ms. Remains : 371/411 places, 480/548 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-06 finished in 60559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((p1||G(p2))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 525
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 525
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 390 transition count 514
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 390 transition count 514
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 385 transition count 506
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 385 transition count 506
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 381 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 381 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 377 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 377 transition count 494
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 373 transition count 489
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 373 transition count 489
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 372 transition count 487
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 372 transition count 487
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 81 place count 372 transition count 484
Applied a total of 81 rules in 45 ms. Remains 372 /411 variables (removed 39) and now considering 484/548 (removed 64) transitions.
// Phase 1: matrix 484 rows 372 cols
[2024-06-01 00:35:44] [INFO ] Computed 18 invariants in 6 ms
[2024-06-01 00:35:44] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 00:35:44] [INFO ] Invariant cache hit.
[2024-06-01 00:35:45] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 483 sub problems to find dead transitions.
[2024-06-01 00:35:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-01 00:35:50] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:35:50] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-06-01 00:35:51] [INFO ] Deduced a trap composed of 224 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:35:51] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
[2024-06-01 00:35:51] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-06-01 00:35:51] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:35:51] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:35:52] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:35:52] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:35:52] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:35:52] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 2 ms to minimize.
[2024-06-01 00:35:52] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:35:53] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2024-06-01 00:35:53] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:35:53] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:35:53] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:35:54] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:35:54] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:35:55] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:35:55] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-01 00:35:58] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:35:59] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:36:01] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:36:01] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-01 00:36:04] [INFO ] Deduced a trap composed of 203 places in 97 ms of which 1 ms to minimize.
[2024-06-01 00:36:04] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:36:06] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-01 00:36:08] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:36:08] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:36:08] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:36:09] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:36:09] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/856 variables, and 50 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/372 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 483 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 32/50 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-01 00:36:18] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:36:18] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:36:18] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:36:18] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:36:18] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2024-06-01 00:36:19] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:36:19] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:36:19] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:36:20] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:36:20] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:36:20] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:36:21] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 3 ms to minimize.
[2024-06-01 00:36:21] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-01 00:36:23] [INFO ] Deduced a trap composed of 136 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:36:23] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:36:23] [INFO ] Deduced a trap composed of 135 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:36:24] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:36:24] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2024-06-01 00:36:24] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 1 ms to minimize.
[2024-06-01 00:36:25] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:36:25] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:36:25] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:36:25] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:36:25] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:36:26] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 1 ms to minimize.
[2024-06-01 00:36:26] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 13/76 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 7 (OVERLAPS) 484/856 variables, 372/448 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/856 variables, 483/931 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-01 00:36:36] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 2 ms to minimize.
[2024-06-01 00:36:39] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:36:39] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/856 variables, 3/934 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 856/856 variables, and 934 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 61/61 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 483 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 372/411 places, 484/548 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60434 ms. Remains : 372/411 places, 484/548 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-07
Product exploration explored 100000 steps with 873 reset in 200 ms.
Product exploration explored 100000 steps with 879 reset in 169 ms.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p1) p2)), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false, false]
RANDOM walk for 40000 steps (345 resets) in 392 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (62 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (59 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (60 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (62 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (60 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (60 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 643944 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :3 out of 6
Probabilistic random walk after 643944 steps, saw 138209 distinct states, run finished after 3004 ms. (steps per millisecond=214 ) properties seen :3
[2024-06-01 00:36:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 102/104 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 00:36:49] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:36:49] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/106 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 266/372 variables, 8/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 484/856 variables, 372/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/856 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/856 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 856/856 variables, and 392 constraints, problems are : Problem set: 1 solved, 2 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/104 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/106 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 266/372 variables, 8/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 484/856 variables, 372/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/856 variables, 2/394 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/856 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/856 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 856/856 variables, and 394 constraints, problems are : Problem set: 1 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 601ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1470 steps, including 10 resets, run visited all 2 properties in 22 ms. (steps per millisecond=66 )
Parikh walk visited 2 properties in 21 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p1) p2)), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F p1), (F (NOT p2)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 16 factoid took 183 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2), false]
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (NOT p2), false]
Support contains 2 out of 372 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 : 372/372 places, 484/484 transitions.
Graph (trivial) has 417 edges and 372 vertex of which 69 / 372 are part of one of the 21 SCC in 2 ms
Free SCC test removed 48 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 323 transition count 290
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 149 rules applied. Total rules applied 286 place count 187 transition count 277
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 294 place count 180 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 295 place count 179 transition count 276
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 295 place count 179 transition count 271
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 305 place count 174 transition count 271
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 323 place count 156 transition count 244
Iterating global reduction 4 with 18 rules applied. Total rules applied 341 place count 156 transition count 244
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 346 place count 156 transition count 239
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 351 place count 151 transition count 239
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 360 place count 142 transition count 225
Iterating global reduction 6 with 9 rules applied. Total rules applied 369 place count 142 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 372 place count 142 transition count 222
Performed 48 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 468 place count 94 transition count 171
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 475 place count 94 transition count 164
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 484 place count 85 transition count 146
Iterating global reduction 8 with 9 rules applied. Total rules applied 493 place count 85 transition count 146
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 496 place count 82 transition count 141
Iterating global reduction 8 with 3 rules applied. Total rules applied 499 place count 82 transition count 141
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 500 place count 81 transition count 137
Iterating global reduction 8 with 1 rules applied. Total rules applied 501 place count 81 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 504 place count 81 transition count 134
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 514 place count 76 transition count 179
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 515 place count 75 transition count 177
Iterating global reduction 9 with 1 rules applied. Total rules applied 516 place count 75 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 533 place count 75 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 535 place count 74 transition count 172
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 536 place count 73 transition count 169
Iterating global reduction 9 with 1 rules applied. Total rules applied 537 place count 73 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 545 place count 73 transition count 161
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 546 place count 73 transition count 161
Applied a total of 546 rules in 42 ms. Remains 73 /372 variables (removed 299) and now considering 161/484 (removed 323) transitions.
[2024-06-01 00:36:50] [INFO ] Flow matrix only has 151 transitions (discarded 10 similar events)
// Phase 1: matrix 151 rows 73 cols
[2024-06-01 00:36:50] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 00:36:50] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 00:36:50] [INFO ] Flow matrix only has 151 transitions (discarded 10 similar events)
[2024-06-01 00:36:50] [INFO ] Invariant cache hit.
[2024-06-01 00:36:50] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 00:36:50] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-06-01 00:36:50] [INFO ] Redundant transitions in 31 ms returned []
Running 153 sub problems to find dead transitions.
[2024-06-01 00:36:50] [INFO ] Flow matrix only has 151 transitions (discarded 10 similar events)
[2024-06-01 00:36:50] [INFO ] Invariant cache hit.
[2024-06-01 00:36:50] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 00:36:51] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:36:51] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 150/223 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 22/106 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 1/224 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/224 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 107 constraints, problems are : Problem set: 0 solved, 153 unsolved in 4431 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-01 00:36:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:36:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:36:55] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 150/223 variables, 73/87 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 22/109 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 153/262 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 1/224 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 263 constraints, problems are : Problem set: 0 solved, 153 unsolved in 6597 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 5/5 constraints]
After SMT, in 11113ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 11115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/372 places, 161/484 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11306 ms. Remains : 73/372 places, 161/484 transitions.
Computed a total of 2 stabilizing places and 10 stable transitions
Computed a total of 2 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p2), (NOT p2), false]
RANDOM walk for 40000 steps (3500 resets) in 571 ms. (69 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (262 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
[2024-06-01 00:37:02] [INFO ] Flow matrix only has 151 transitions (discarded 10 similar events)
[2024-06-01 00:37:02] [INFO ] Invariant cache hit.
[2024-06-01 00:37:02] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/73 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 150/223 variables, 73/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/224 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/224 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:37:02] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 49/73 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 150/223 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 22/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/224 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/224 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p2), false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (NOT p2), false]
Product exploration explored 100000 steps with 7958 reset in 255 ms.
Product exploration explored 100000 steps with 7899 reset in 212 ms.
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 161/161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 71 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 71 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 70 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 70 transition count 154
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 67 transition count 149
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 67 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 67 transition count 146
Applied a total of 15 rules in 6 ms. Remains 67 /73 variables (removed 6) and now considering 146/161 (removed 15) transitions.
[2024-06-01 00:37:03] [INFO ] Flow matrix only has 136 transitions (discarded 10 similar events)
// Phase 1: matrix 136 rows 67 cols
[2024-06-01 00:37:03] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:37:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 00:37:03] [INFO ] Flow matrix only has 136 transitions (discarded 10 similar events)
[2024-06-01 00:37:03] [INFO ] Invariant cache hit.
[2024-06-01 00:37:03] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 00:37:03] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-01 00:37:03] [INFO ] Redundant transitions in 16 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 00:37:03] [INFO ] Flow matrix only has 136 transitions (discarded 10 similar events)
[2024-06-01 00:37:03] [INFO ] Invariant cache hit.
[2024-06-01 00:37:03] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 00:37:03] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:37:03] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:37:03] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 135/202 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 22/101 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 1/203 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 102 constraints, problems are : Problem set: 0 solved, 138 unsolved in 3861 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 00:37:07] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 135/202 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 22/102 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 138/240 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 1/203 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 241 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5587 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints]
After SMT, in 9521ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 9522ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/73 places, 146/161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9648 ms. Remains : 67/73 places, 146/161 transitions.
Treatment of property HealthRecord-PT-17-LTLFireability-07 finished in 88156 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) U p1))'
Support contains 6 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Graph (trivial) has 468 edges and 411 vertex of which 78 / 411 are part of one of the 21 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 353 transition count 339
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 156 rules applied. Total rules applied 299 place count 211 transition count 325
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 307 place count 204 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 308 place count 203 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 308 place count 203 transition count 318
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 320 place count 197 transition count 318
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 349 place count 168 transition count 267
Iterating global reduction 4 with 29 rules applied. Total rules applied 378 place count 168 transition count 267
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 384 place count 168 transition count 261
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 390 place count 162 transition count 261
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 401 place count 151 transition count 243
Iterating global reduction 6 with 11 rules applied. Total rules applied 412 place count 151 transition count 243
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 415 place count 151 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 416 place count 150 transition count 240
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 421 place count 145 transition count 233
Iterating global reduction 8 with 5 rules applied. Total rules applied 426 place count 145 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 429 place count 145 transition count 230
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 432 place count 142 transition count 227
Iterating global reduction 9 with 3 rules applied. Total rules applied 435 place count 142 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 438 place count 142 transition count 224
Performed 51 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 10 with 102 rules applied. Total rules applied 540 place count 91 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 545 place count 91 transition count 164
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 551 place count 85 transition count 152
Iterating global reduction 11 with 6 rules applied. Total rules applied 557 place count 85 transition count 152
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 558 place count 84 transition count 151
Iterating global reduction 11 with 1 rules applied. Total rules applied 559 place count 84 transition count 151
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 565 place count 81 transition count 176
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 566 place count 80 transition count 174
Iterating global reduction 11 with 1 rules applied. Total rules applied 567 place count 80 transition count 174
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 568 place count 79 transition count 170
Iterating global reduction 11 with 1 rules applied. Total rules applied 569 place count 79 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 573 place count 79 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 575 place count 78 transition count 179
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 577 place count 76 transition count 173
Iterating global reduction 12 with 2 rules applied. Total rules applied 579 place count 76 transition count 173
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 580 place count 75 transition count 169
Iterating global reduction 12 with 1 rules applied. Total rules applied 581 place count 75 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 586 place count 75 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 13 with 13 rules applied. Total rules applied 599 place count 75 transition count 151
Applied a total of 599 rules in 40 ms. Remains 75 /411 variables (removed 336) and now considering 151/548 (removed 397) transitions.
[2024-06-01 00:37:13] [INFO ] Flow matrix only has 141 transitions (discarded 10 similar events)
// Phase 1: matrix 141 rows 75 cols
[2024-06-01 00:37:13] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 00:37:13] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 00:37:13] [INFO ] Flow matrix only has 141 transitions (discarded 10 similar events)
[2024-06-01 00:37:13] [INFO ] Invariant cache hit.
[2024-06-01 00:37:13] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 00:37:13] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-01 00:37:13] [INFO ] Redundant transitions in 13 ms returned []
Running 147 sub problems to find dead transitions.
[2024-06-01 00:37:13] [INFO ] Flow matrix only has 141 transitions (discarded 10 similar events)
[2024-06-01 00:37:13] [INFO ] Invariant cache hit.
[2024-06-01 00:37:13] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 00:37:13] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:37:13] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 140/215 variables, 75/86 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 00:37:14] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:37:14] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 1/216 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/216 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 105 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4070 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-06-01 00:37:17] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:37:17] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 140/215 variables, 75/90 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 16/106 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 147/253 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 1/216 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (OVERLAPS) 0/216 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 254 constraints, problems are : Problem set: 0 solved, 147 unsolved in 5602 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 6/6 constraints]
After SMT, in 9729ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 9731ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/411 places, 151/548 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9896 ms. Remains : 75/411 places, 151/548 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-08 finished in 9983 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||G(p1)))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Graph (trivial) has 474 edges and 411 vertex of which 78 / 411 are part of one of the 21 SCC in 2 ms
Free SCC test removed 57 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 353 transition count 336
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 157 rules applied. Total rules applied 303 place count 208 transition count 324
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 309 place count 202 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 309 place count 202 transition count 318
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 321 place count 196 transition count 318
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 349 place count 168 transition count 269
Iterating global reduction 3 with 28 rules applied. Total rules applied 377 place count 168 transition count 269
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 382 place count 168 transition count 264
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 387 place count 163 transition count 264
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 398 place count 152 transition count 247
Iterating global reduction 5 with 11 rules applied. Total rules applied 409 place count 152 transition count 247
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 413 place count 152 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 414 place count 151 transition count 243
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 419 place count 146 transition count 236
Iterating global reduction 7 with 5 rules applied. Total rules applied 424 place count 146 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 427 place count 146 transition count 233
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 430 place count 143 transition count 230
Iterating global reduction 8 with 3 rules applied. Total rules applied 433 place count 143 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 436 place count 143 transition count 227
Performed 55 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 9 with 110 rules applied. Total rules applied 546 place count 88 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 552 place count 88 transition count 162
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 559 place count 81 transition count 148
Iterating global reduction 10 with 7 rules applied. Total rules applied 566 place count 81 transition count 148
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 568 place count 79 transition count 145
Iterating global reduction 10 with 2 rules applied. Total rules applied 570 place count 79 transition count 145
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 571 place count 78 transition count 141
Iterating global reduction 10 with 1 rules applied. Total rules applied 572 place count 78 transition count 141
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 582 place count 73 transition count 193
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 585 place count 70 transition count 183
Iterating global reduction 10 with 3 rules applied. Total rules applied 588 place count 70 transition count 183
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 590 place count 68 transition count 175
Iterating global reduction 10 with 2 rules applied. Total rules applied 592 place count 68 transition count 175
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 602 place count 68 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 604 place count 67 transition count 178
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 605 place count 66 transition count 176
Iterating global reduction 11 with 1 rules applied. Total rules applied 606 place count 66 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 11 with 18 rules applied. Total rules applied 624 place count 66 transition count 158
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 625 place count 65 transition count 155
Iterating global reduction 11 with 1 rules applied. Total rules applied 626 place count 65 transition count 155
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 629 place count 62 transition count 149
Iterating global reduction 11 with 3 rules applied. Total rules applied 632 place count 62 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 634 place count 61 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 645 place count 61 transition count 148
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 649 place count 61 transition count 148
Applied a total of 649 rules in 47 ms. Remains 61 /411 variables (removed 350) and now considering 148/548 (removed 400) transitions.
[2024-06-01 00:37:22] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
// Phase 1: matrix 136 rows 61 cols
[2024-06-01 00:37:22] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 00:37:23] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 00:37:23] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
[2024-06-01 00:37:23] [INFO ] Invariant cache hit.
[2024-06-01 00:37:23] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 00:37:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-06-01 00:37:23] [INFO ] Redundant transitions in 17 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 00:37:23] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
[2024-06-01 00:37:23] [INFO ] Invariant cache hit.
[2024-06-01 00:37:23] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 00:37:23] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:37:23] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 135/196 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 1/197 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 99 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3421 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 00:37:26] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 135/196 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 140/239 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 1/197 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 240 constraints, problems are : Problem set: 0 solved, 140 unsolved in 5416 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 3/3 constraints]
After SMT, in 8913ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 8915ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/411 places, 148/548 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9083 ms. Remains : 61/411 places, 148/548 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 7479 reset in 150 ms.
Product exploration explored 100000 steps with 7466 reset in 153 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3349 resets) in 195 ms. (204 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (270 resets) in 20 ms. (1904 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (276 resets) in 20 ms. (1904 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (274 resets) in 16 ms. (2353 steps per ms) remains 3/3 properties
[2024-06-01 00:37:32] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
[2024-06-01 00:37:32] [INFO ] Invariant cache hit.
[2024-06-01 00:37:32] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/61 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:37:32] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:37:32] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 135/196 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/197 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 99 constraints, problems are : Problem set: 0 solved, 3 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/61 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:37:32] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 135/196 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/197 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 103 constraints, problems are : Problem set: 0 solved, 3 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 56 steps, including 3 resets, run visited all 3 properties in 2 ms. (steps per millisecond=28 )
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 2 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-06-01 00:37:33] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
[2024-06-01 00:37:33] [INFO ] Invariant cache hit.
[2024-06-01 00:37:33] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 00:37:33] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
[2024-06-01 00:37:33] [INFO ] Invariant cache hit.
[2024-06-01 00:37:33] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 00:37:33] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-06-01 00:37:33] [INFO ] Redundant transitions in 19 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 00:37:33] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
[2024-06-01 00:37:33] [INFO ] Invariant cache hit.
[2024-06-01 00:37:33] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 00:37:34] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:37:34] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 135/196 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 1/197 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 99 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3477 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 00:37:37] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 135/196 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 140/239 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 1/197 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 240 constraints, problems are : Problem set: 0 solved, 140 unsolved in 5509 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 3/3 constraints]
After SMT, in 9067ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 9071ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9210 ms. Remains : 61/61 places, 148/148 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3365 resets) in 167 ms. (238 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (273 resets) in 20 ms. (1904 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (273 resets) in 19 ms. (2000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (272 resets) in 16 ms. (2353 steps per ms) remains 3/3 properties
[2024-06-01 00:37:42] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
[2024-06-01 00:37:42] [INFO ] Invariant cache hit.
[2024-06-01 00:37:42] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/61 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:37:42] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:37:43] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 135/196 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/197 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 99 constraints, problems are : Problem set: 0 solved, 3 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/61 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:37:43] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 135/196 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/197 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 103 constraints, problems are : Problem set: 0 solved, 3 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2056 steps, including 201 resets, run visited all 3 properties in 8 ms. (steps per millisecond=257 )
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 8 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7487 reset in 152 ms.
Product exploration explored 100000 steps with 7461 reset in 157 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-06-01 00:37:44] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
[2024-06-01 00:37:44] [INFO ] Invariant cache hit.
[2024-06-01 00:37:44] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 00:37:44] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
[2024-06-01 00:37:44] [INFO ] Invariant cache hit.
[2024-06-01 00:37:44] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 00:37:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-01 00:37:44] [INFO ] Redundant transitions in 18 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 00:37:44] [INFO ] Flow matrix only has 136 transitions (discarded 12 similar events)
[2024-06-01 00:37:44] [INFO ] Invariant cache hit.
[2024-06-01 00:37:44] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 00:37:44] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:37:44] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 135/196 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 1/197 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 99 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3515 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 00:37:48] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 135/196 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 140/239 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 1/197 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 240 constraints, problems are : Problem set: 0 solved, 140 unsolved in 5637 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 3/3 constraints]
After SMT, in 9231ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 9232ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9362 ms. Remains : 61/61 places, 148/148 transitions.
Treatment of property HealthRecord-PT-17-LTLFireability-10 finished in 30468 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)&&F(G(p1)))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Graph (trivial) has 474 edges and 411 vertex of which 78 / 411 are part of one of the 21 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 353 transition count 338
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 156 rules applied. Total rules applied 300 place count 210 transition count 325
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 308 place count 203 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 309 place count 202 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 309 place count 202 transition count 318
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 321 place count 196 transition count 318
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 350 place count 167 transition count 267
Iterating global reduction 4 with 29 rules applied. Total rules applied 379 place count 167 transition count 267
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 385 place count 167 transition count 261
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 391 place count 161 transition count 261
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 403 place count 149 transition count 242
Iterating global reduction 6 with 12 rules applied. Total rules applied 415 place count 149 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 419 place count 149 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 420 place count 148 transition count 238
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 425 place count 143 transition count 231
Iterating global reduction 8 with 5 rules applied. Total rules applied 430 place count 143 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 433 place count 143 transition count 228
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 436 place count 140 transition count 225
Iterating global reduction 9 with 3 rules applied. Total rules applied 439 place count 140 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 442 place count 140 transition count 222
Performed 54 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 10 with 108 rules applied. Total rules applied 550 place count 86 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 556 place count 86 transition count 158
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 563 place count 79 transition count 144
Iterating global reduction 11 with 7 rules applied. Total rules applied 570 place count 79 transition count 144
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 572 place count 77 transition count 141
Iterating global reduction 11 with 2 rules applied. Total rules applied 574 place count 77 transition count 141
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 575 place count 76 transition count 137
Iterating global reduction 11 with 1 rules applied. Total rules applied 576 place count 76 transition count 137
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 582 place count 73 transition count 182
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 584 place count 71 transition count 176
Iterating global reduction 11 with 2 rules applied. Total rules applied 586 place count 71 transition count 176
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 587 place count 70 transition count 172
Iterating global reduction 11 with 1 rules applied. Total rules applied 588 place count 70 transition count 172
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 593 place count 70 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 12 with 15 rules applied. Total rules applied 608 place count 70 transition count 152
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 609 place count 69 transition count 149
Iterating global reduction 12 with 1 rules applied. Total rules applied 610 place count 69 transition count 149
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 613 place count 66 transition count 144
Iterating global reduction 12 with 3 rules applied. Total rules applied 616 place count 66 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 618 place count 65 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 621 place count 65 transition count 151
Applied a total of 621 rules in 43 ms. Remains 65 /411 variables (removed 346) and now considering 151/548 (removed 397) transitions.
[2024-06-01 00:37:53] [INFO ] Flow matrix only has 141 transitions (discarded 10 similar events)
// Phase 1: matrix 141 rows 65 cols
[2024-06-01 00:37:53] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:37:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 00:37:53] [INFO ] Flow matrix only has 141 transitions (discarded 10 similar events)
[2024-06-01 00:37:53] [INFO ] Invariant cache hit.
[2024-06-01 00:37:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 00:37:53] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-06-01 00:37:53] [INFO ] Redundant transitions in 14 ms returned []
Running 135 sub problems to find dead transitions.
[2024-06-01 00:37:53] [INFO ] Flow matrix only has 141 transitions (discarded 10 similar events)
[2024-06-01 00:37:53] [INFO ] Invariant cache hit.
[2024-06-01 00:37:53] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 00:37:54] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:37:54] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 00:37:54] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 140/205 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 25/102 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 103 constraints, problems are : Problem set: 0 solved, 135 unsolved in 3398 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 00:37:57] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-06-01 00:37:57] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:37:57] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 140/205 variables, 65/80 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 25/105 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 135/240 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 241 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6002 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 6/6 constraints]
After SMT, in 9474ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 9476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/411 places, 151/548 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9648 ms. Remains : 65/411 places, 151/548 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-11
Stuttering criterion allowed to conclude after 57 steps with 5 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-11 finished in 9780 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)&&F(p1))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Graph (trivial) has 472 edges and 411 vertex of which 73 / 411 are part of one of the 20 SCC in 0 ms
Free SCC test removed 53 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 357 transition count 340
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 160 rules applied. Total rules applied 307 place count 211 transition count 326
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 314 place count 204 transition count 326
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 314 place count 204 transition count 320
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 326 place count 198 transition count 320
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 356 place count 168 transition count 267
Iterating global reduction 3 with 30 rules applied. Total rules applied 386 place count 168 transition count 267
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 392 place count 168 transition count 261
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 398 place count 162 transition count 261
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 410 place count 150 transition count 242
Iterating global reduction 5 with 12 rules applied. Total rules applied 422 place count 150 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 426 place count 150 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 427 place count 149 transition count 238
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 432 place count 144 transition count 231
Iterating global reduction 7 with 5 rules applied. Total rules applied 437 place count 144 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 440 place count 144 transition count 228
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 443 place count 141 transition count 225
Iterating global reduction 8 with 3 rules applied. Total rules applied 446 place count 141 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 448 place count 141 transition count 223
Performed 53 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 9 with 106 rules applied. Total rules applied 554 place count 88 transition count 166
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 560 place count 88 transition count 160
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 567 place count 81 transition count 146
Iterating global reduction 10 with 7 rules applied. Total rules applied 574 place count 81 transition count 146
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 576 place count 79 transition count 143
Iterating global reduction 10 with 2 rules applied. Total rules applied 578 place count 79 transition count 143
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 579 place count 78 transition count 139
Iterating global reduction 10 with 1 rules applied. Total rules applied 580 place count 78 transition count 139
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 586 place count 75 transition count 176
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 587 place count 74 transition count 174
Iterating global reduction 10 with 1 rules applied. Total rules applied 588 place count 74 transition count 174
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 589 place count 73 transition count 170
Iterating global reduction 10 with 1 rules applied. Total rules applied 590 place count 73 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 594 place count 73 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 596 place count 72 transition count 178
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 598 place count 70 transition count 172
Iterating global reduction 11 with 2 rules applied. Total rules applied 600 place count 70 transition count 172
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 601 place count 69 transition count 168
Iterating global reduction 11 with 1 rules applied. Total rules applied 602 place count 69 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 607 place count 69 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 12 with 16 rules applied. Total rules applied 623 place count 69 transition count 147
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 624 place count 68 transition count 144
Iterating global reduction 12 with 1 rules applied. Total rules applied 625 place count 68 transition count 144
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 628 place count 65 transition count 139
Iterating global reduction 12 with 3 rules applied. Total rules applied 631 place count 65 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 633 place count 64 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 12 with 11 rules applied. Total rules applied 644 place count 64 transition count 138
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 645 place count 64 transition count 138
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 646 place count 63 transition count 137
Iterating global reduction 12 with 1 rules applied. Total rules applied 647 place count 63 transition count 137
Applied a total of 647 rules in 49 ms. Remains 63 /411 variables (removed 348) and now considering 137/548 (removed 411) transitions.
[2024-06-01 00:38:03] [INFO ] Flow matrix only has 128 transitions (discarded 9 similar events)
// Phase 1: matrix 128 rows 63 cols
[2024-06-01 00:38:03] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:38:03] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 00:38:03] [INFO ] Flow matrix only has 128 transitions (discarded 9 similar events)
[2024-06-01 00:38:03] [INFO ] Invariant cache hit.
[2024-06-01 00:38:03] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 00:38:03] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-01 00:38:03] [INFO ] Redundant transitions in 14 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 00:38:03] [INFO ] Flow matrix only has 128 transitions (discarded 9 similar events)
[2024-06-01 00:38:03] [INFO ] Invariant cache hit.
[2024-06-01 00:38:03] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 00:38:03] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:38:03] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 127/190 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 1/191 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 97 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3287 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 00:38:06] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:38:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 127/190 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 22/98 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 129/227 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 1/191 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 228 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4907 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 4/4 constraints]
After SMT, in 8266ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 8268ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/411 places, 137/548 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8433 ms. Remains : 63/411 places, 137/548 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-12 finished in 8566 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(X(G(p0)))&&F(p1)))'
Support contains 4 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 525
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 525
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 390 transition count 513
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 390 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 385 transition count 505
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 385 transition count 505
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 378 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 378 transition count 495
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 371 transition count 484
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 371 transition count 484
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 364 transition count 476
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 364 transition count 476
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 361 transition count 473
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 361 transition count 473
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 103 place count 361 transition count 470
Applied a total of 103 rules in 33 ms. Remains 361 /411 variables (removed 50) and now considering 470/548 (removed 78) transitions.
// Phase 1: matrix 470 rows 361 cols
[2024-06-01 00:38:11] [INFO ] Computed 18 invariants in 5 ms
[2024-06-01 00:38:11] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 00:38:11] [INFO ] Invariant cache hit.
[2024-06-01 00:38:12] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2024-06-01 00:38:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-01 00:38:17] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 3 ms to minimize.
[2024-06-01 00:38:17] [INFO ] Deduced a trap composed of 139 places in 110 ms of which 2 ms to minimize.
[2024-06-01 00:38:17] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 2 ms to minimize.
[2024-06-01 00:38:17] [INFO ] Deduced a trap composed of 150 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:38:17] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 00:38:17] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:38:18] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:38:18] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:38:18] [INFO ] Deduced a trap composed of 192 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:38:18] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:38:19] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:38:19] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:38:19] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 2 ms to minimize.
[2024-06-01 00:38:20] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:38:20] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:38:20] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:38:20] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 2 ms to minimize.
[2024-06-01 00:38:20] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:38:21] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:38:21] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-01 00:38:24] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:38:24] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:38:24] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:38:24] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-06-01 00:38:25] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:38:25] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
[2024-06-01 00:38:25] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:38:26] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:38:27] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:38:27] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-01 00:38:28] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:38:29] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:38:29] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:38:29] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:38:30] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:38:30] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:38:31] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-01 00:38:34] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 7 ms to minimize.
[2024-06-01 00:38:35] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-01 00:38:38] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2024-06-01 00:38:39] [INFO ] Deduced a trap composed of 213 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:38:39] [INFO ] Deduced a trap composed of 136 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/831 variables, and 60 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 42/60 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-01 00:38:45] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:38:45] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:38:45] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:38:45] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-01 00:38:49] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:38:49] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:38:49] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:38:49] [INFO ] Deduced a trap composed of 107 places in 79 ms of which 1 ms to minimize.
[2024-06-01 00:38:50] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-01 00:38:55] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:38:55] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:38:55] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:38:56] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-06-01 00:38:59] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:39:00] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 9 (OVERLAPS) 470/831 variables, 361/436 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 469/905 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 831/831 variables, and 905 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 57/57 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 469 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 361/411 places, 470/548 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60395 ms. Remains : 361/411 places, 470/548 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLFireability-13 finished in 60645 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(X(G(!p0))))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 396 transition count 524
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 396 transition count 524
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 388 transition count 511
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 388 transition count 511
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 382 transition count 501
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 382 transition count 501
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 375 transition count 491
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 375 transition count 491
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 79 place count 368 transition count 480
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 368 transition count 480
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 361 transition count 472
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 361 transition count 472
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 357 transition count 467
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 357 transition count 467
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 114 place count 357 transition count 461
Applied a total of 114 rules in 39 ms. Remains 357 /411 variables (removed 54) and now considering 461/548 (removed 87) transitions.
// Phase 1: matrix 461 rows 357 cols
[2024-06-01 00:39:12] [INFO ] Computed 18 invariants in 6 ms
[2024-06-01 00:39:12] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 00:39:12] [INFO ] Invariant cache hit.
[2024-06-01 00:39:12] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 00:39:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:39:17] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:39:17] [INFO ] Deduced a trap composed of 176 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:39:18] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:39:18] [INFO ] Deduced a trap composed of 200 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:39:18] [INFO ] Deduced a trap composed of 192 places in 101 ms of which 2 ms to minimize.
[2024-06-01 00:39:18] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:39:18] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 3 ms to minimize.
[2024-06-01 00:39:19] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:39:19] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:39:19] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:39:19] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:39:20] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
[2024-06-01 00:39:20] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:39:20] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:39:20] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:39:21] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:39:21] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:39:21] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:39:21] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-06-01 00:39:21] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:39:24] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 3 ms to minimize.
[2024-06-01 00:39:24] [INFO ] Deduced a trap composed of 126 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:39:24] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:39:24] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:39:25] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:39:25] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:39:25] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 2 ms to minimize.
[2024-06-01 00:39:26] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:39:26] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:39:26] [INFO ] Deduced a trap composed of 212 places in 83 ms of which 1 ms to minimize.
[2024-06-01 00:39:26] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:39:27] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:39:27] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:39:28] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:39:28] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:39:28] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:39:28] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:39:28] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:39:29] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:39:31] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-06-01 00:39:31] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:39:31] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:39:32] [INFO ] Deduced a trap composed of 113 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:39:39] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:39:40] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:39:40] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:39:40] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:39:40] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:39:41] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/818 variables, and 67 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:39:45] [INFO ] Deduced a trap composed of 134 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:39:45] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:39:46] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:39:48] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:39:49] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:39:49] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:39:54] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:39:56] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (OVERLAPS) 461/818 variables, 357/432 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 460/892 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:40:03] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:40:03] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:40:07] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:40:07] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 896 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 61/61 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 357/411 places, 461/548 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60395 ms. Remains : 357/411 places, 461/548 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, p0, p0, p0]
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-14
Product exploration explored 100000 steps with 880 reset in 109 ms.
Product exploration explored 100000 steps with 878 reset in 116 ms.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (345 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (60 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1676611 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :0 out of 1
Probabilistic random walk after 1676611 steps, saw 326108 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
[2024-06-01 00:40:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:40:16] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:40:16] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:40:16] [INFO ] Deduced a trap composed of 58 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/142 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 215/357 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:40:16] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:40:16] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:40:16] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:40:16] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 461/818 variables, 357/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/818 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 382 constraints, problems are : Problem set: 0 solved, 1 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/142 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/357 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 461/818 variables, 357/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/818 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/818 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/818 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 383 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 792ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=79 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 109 ms :[true, p0, p0, p0]
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 461/461 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2024-06-01 00:40:17] [INFO ] Invariant cache hit.
[2024-06-01 00:40:17] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 00:40:17] [INFO ] Invariant cache hit.
[2024-06-01 00:40:17] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 00:40:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:40:22] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-06-01 00:40:23] [INFO ] Deduced a trap composed of 176 places in 101 ms of which 2 ms to minimize.
[2024-06-01 00:40:23] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:40:23] [INFO ] Deduced a trap composed of 200 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:40:23] [INFO ] Deduced a trap composed of 192 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:40:23] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:40:24] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-06-01 00:40:24] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:40:24] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 3 ms to minimize.
[2024-06-01 00:40:24] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 2 ms to minimize.
[2024-06-01 00:40:24] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:40:25] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:40:25] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:40:25] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-06-01 00:40:26] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:40:26] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:40:26] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:40:26] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:40:26] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:40:26] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:40:29] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 3 ms to minimize.
[2024-06-01 00:40:29] [INFO ] Deduced a trap composed of 126 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:40:29] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:40:30] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:40:30] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:40:30] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:40:30] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:40:31] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2024-06-01 00:40:31] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:40:31] [INFO ] Deduced a trap composed of 212 places in 83 ms of which 3 ms to minimize.
[2024-06-01 00:40:32] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-06-01 00:40:32] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:40:32] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:40:33] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:40:33] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:40:33] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:40:33] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:40:34] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:40:34] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 00:40:36] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:40:36] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:40:36] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:40:38] [INFO ] Deduced a trap composed of 113 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:40:45] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:40:45] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2024-06-01 00:40:45] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-06-01 00:40:45] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:40:46] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:40:46] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/818 variables, and 67 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:40:50] [INFO ] Deduced a trap composed of 134 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:40:50] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:40:51] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:40:53] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:40:54] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:40:55] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:40:59] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:41:02] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (OVERLAPS) 461/818 variables, 357/432 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 460/892 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:41:08] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:41:08] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:41:12] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:41:12] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 896 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 61/61 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in LTL mode , in 1 iterations and 60369 ms. Remains : 357/357 places, 461/461 transitions.
Computed a total of 110 stabilizing places and 117 stable transitions
Computed a total of 110 stabilizing places and 117 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, p0, p0, p0]
RANDOM walk for 40000 steps (351 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (60 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1713310 steps, run timeout after 3001 ms. (steps per millisecond=570 ) properties seen :0 out of 1
Probabilistic random walk after 1713310 steps, saw 332251 distinct states, run finished after 3001 ms. (steps per millisecond=570 ) properties seen :0
[2024-06-01 00:41:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:41:21] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:41:21] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:41:21] [INFO ] Deduced a trap composed of 58 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/142 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 215/357 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:41:21] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:41:21] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:41:21] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:41:21] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 461/818 variables, 357/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/818 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 382 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/142 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/357 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 461/818 variables, 357/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/818 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/818 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/818 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 383 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 826ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 86 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 120 ms :[true, p0, p0, p0]
Stuttering acceptance computed with spot in 123 ms :[true, p0, p0, p0]
Product exploration explored 100000 steps with 876 reset in 109 ms.
Product exploration explored 100000 steps with 874 reset in 116 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, p0, p0, p0]
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 357/357 places, 461/461 transitions.
Graph (trivial) has 402 edges and 357 vertex of which 60 / 357 are part of one of the 21 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 318 transition count 416
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 143 place count 318 transition count 410
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 143 place count 318 transition count 410
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 318 transition count 410
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 244 place count 222 transition count 309
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 340 place count 222 transition count 309
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 344 place count 218 transition count 305
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 348 place count 218 transition count 305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 351 place count 218 transition count 302
Performed 60 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 3 with 60 rules applied. Total rules applied 411 place count 218 transition count 328
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 420 place count 218 transition count 319
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 472 place count 166 transition count 251
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 4 with 52 rules applied. Total rules applied 524 place count 166 transition count 251
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 529 place count 161 transition count 244
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 534 place count 161 transition count 244
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 540 place count 155 transition count 226
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 546 place count 155 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 549 place count 155 transition count 223
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 565 place count 155 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 566 place count 155 transition count 360
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 583 place count 138 transition count 313
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 6 with 17 rules applied. Total rules applied 600 place count 138 transition count 313
Deduced a syphon composed of 72 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 628 place count 138 transition count 285
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 634 place count 132 transition count 266
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 640 place count 132 transition count 266
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 641 place count 132 transition count 281
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 644 place count 129 transition count 274
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 647 place count 129 transition count 274
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 650 place count 126 transition count 269
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 653 place count 126 transition count 269
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 654 place count 125 transition count 268
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 655 place count 125 transition count 268
Deduced a syphon composed of 64 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 658 place count 125 transition count 265
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 658 rules in 62 ms. Remains 125 /357 variables (removed 232) and now considering 265/461 (removed 196) transitions.
[2024-06-01 00:41:23] [INFO ] Redundant transitions in 19 ms returned []
Running 257 sub problems to find dead transitions.
[2024-06-01 00:41:23] [INFO ] Flow matrix only has 250 transitions (discarded 15 similar events)
// Phase 1: matrix 250 rows 125 cols
[2024-06-01 00:41:23] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:41:23] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD47 is UNSAT
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
[2024-06-01 00:41:24] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 13/22 constraints. Problems are: Problem set: 93 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/22 constraints. Problems are: Problem set: 93 solved, 164 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 4 (OVERLAPS) 249/374 variables, 125/147 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 20/167 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/167 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 1/375 variables, 1/168 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/168 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/375 variables, 0/168 constraints. Problems are: Problem set: 114 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 168 constraints, problems are : Problem set: 114 solved, 143 unsolved in 7053 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 125/125 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 114 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 65/125 variables, 9/9 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 13/22 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/22 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 249/374 variables, 125/147 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 20/167 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 143/310 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/310 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 1/375 variables, 1/311 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/311 constraints. Problems are: Problem set: 114 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/375 variables, 0/311 constraints. Problems are: Problem set: 114 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 311 constraints, problems are : Problem set: 114 solved, 143 unsolved in 8841 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 125/125 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 143/257 constraints, Known Traps: 13/13 constraints]
After SMT, in 15993ms problems are : Problem set: 114 solved, 143 unsolved
Search for dead transitions found 114 dead transitions in 15996ms
Found 114 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 114 transitions
Dead transitions reduction (with SMT) removed 114 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 125/357 places, 151/461 transitions.
Graph (complete) has 266 edges and 125 vertex of which 61 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.0 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 61 /125 variables (removed 64) and now considering 151/151 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/357 places, 151/461 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16094 ms. Remains : 61/357 places, 151/461 transitions.
Support contains 1 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 461/461 transitions.
Applied a total of 0 rules in 4 ms. Remains 357 /357 variables (removed 0) and now considering 461/461 (removed 0) transitions.
// Phase 1: matrix 461 rows 357 cols
[2024-06-01 00:41:39] [INFO ] Computed 18 invariants in 5 ms
[2024-06-01 00:41:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 00:41:39] [INFO ] Invariant cache hit.
[2024-06-01 00:41:39] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-01 00:41:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:41:44] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-01 00:41:44] [INFO ] Deduced a trap composed of 176 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:41:44] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:41:44] [INFO ] Deduced a trap composed of 200 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:41:44] [INFO ] Deduced a trap composed of 192 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:41:45] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:41:45] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-06-01 00:41:45] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:41:45] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:41:45] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:41:45] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-06-01 00:41:46] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:41:47] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:41:47] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:41:47] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:41:47] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:41:47] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:41:47] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:41:47] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-06-01 00:41:47] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:41:50] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-01 00:41:50] [INFO ] Deduced a trap composed of 126 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:41:51] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:41:51] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-06-01 00:41:51] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:41:52] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-06-01 00:41:52] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 3 ms to minimize.
[2024-06-01 00:41:52] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:41:52] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:41:52] [INFO ] Deduced a trap composed of 212 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:41:53] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:41:53] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:41:53] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:41:54] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:41:54] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 2 ms to minimize.
[2024-06-01 00:41:54] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:41:55] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-06-01 00:41:55] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:41:55] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:41:57] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 1 ms to minimize.
[2024-06-01 00:41:57] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:41:58] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:41:59] [INFO ] Deduced a trap composed of 113 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:42:06] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-06-01 00:42:06] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-06-01 00:42:06] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:42:06] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-06-01 00:42:07] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:42:07] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/818 variables, and 67 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:42:12] [INFO ] Deduced a trap composed of 134 places in 97 ms of which 2 ms to minimize.
[2024-06-01 00:42:12] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:42:13] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:42:14] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:42:16] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:42:16] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:42:20] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:42:23] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (OVERLAPS) 461/818 variables, 357/432 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 460/892 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-01 00:42:29] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:42:30] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:42:34] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:42:34] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 896 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 61/61 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in LTL mode , in 1 iterations and 60372 ms. Remains : 357/357 places, 461/461 transitions.
Treatment of property HealthRecord-PT-17-LTLFireability-14 finished in 207056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((p1||G(p2))))))'
Found a Shortening insensitive property : HealthRecord-PT-17-LTLFireability-07
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Graph (trivial) has 471 edges and 411 vertex of which 78 / 411 are part of one of the 21 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 353 transition count 337
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 158 rules applied. Total rules applied 303 place count 209 transition count 323
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 311 place count 202 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 312 place count 201 transition count 322
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 312 place count 201 transition count 316
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 324 place count 195 transition count 316
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 353 place count 166 transition count 265
Iterating global reduction 4 with 29 rules applied. Total rules applied 382 place count 166 transition count 265
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 388 place count 166 transition count 259
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 394 place count 160 transition count 259
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 406 place count 148 transition count 240
Iterating global reduction 6 with 12 rules applied. Total rules applied 418 place count 148 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 421 place count 148 transition count 237
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 424 place count 145 transition count 234
Iterating global reduction 7 with 3 rules applied. Total rules applied 427 place count 145 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 430 place count 145 transition count 231
Performed 49 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 528 place count 96 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 535 place count 96 transition count 172
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 544 place count 87 transition count 154
Iterating global reduction 9 with 9 rules applied. Total rules applied 553 place count 87 transition count 154
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 555 place count 85 transition count 151
Iterating global reduction 9 with 2 rules applied. Total rules applied 557 place count 85 transition count 151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 565 place count 81 transition count 189
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 566 place count 80 transition count 187
Iterating global reduction 9 with 1 rules applied. Total rules applied 567 place count 80 transition count 187
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 568 place count 79 transition count 183
Iterating global reduction 9 with 1 rules applied. Total rules applied 569 place count 79 transition count 183
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 573 place count 79 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 575 place count 78 transition count 192
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 577 place count 76 transition count 186
Iterating global reduction 10 with 2 rules applied. Total rules applied 579 place count 76 transition count 186
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 580 place count 75 transition count 182
Iterating global reduction 10 with 1 rules applied. Total rules applied 581 place count 75 transition count 182
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 586 place count 75 transition count 177
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 588 place count 75 transition count 177
Applied a total of 588 rules in 34 ms. Remains 75 /411 variables (removed 336) and now considering 177/548 (removed 371) transitions.
[2024-06-01 00:42:39] [INFO ] Flow matrix only has 167 transitions (discarded 10 similar events)
// Phase 1: matrix 167 rows 75 cols
[2024-06-01 00:42:39] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:42:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 00:42:39] [INFO ] Flow matrix only has 167 transitions (discarded 10 similar events)
[2024-06-01 00:42:39] [INFO ] Invariant cache hit.
[2024-06-01 00:42:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 00:42:39] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-06-01 00:42:39] [INFO ] Flow matrix only has 167 transitions (discarded 10 similar events)
[2024-06-01 00:42:39] [INFO ] Invariant cache hit.
[2024-06-01 00:42:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 00:42:40] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:42:40] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:42:40] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 166/241 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 19/106 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 1/242 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 107 constraints, problems are : Problem set: 0 solved, 162 unsolved in 4856 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-01 00:42:45] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:42:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 166/241 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 19/108 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 162/270 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (OVERLAPS) 1/242 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 271 constraints, problems are : Problem set: 0 solved, 162 unsolved in 7208 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 5/5 constraints]
After SMT, in 12153ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 12154ms
Starting structural reductions in LI_LTL mode, iteration 1 : 75/411 places, 177/548 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12314 ms. Remains : 75/411 places, 177/548 transitions.
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-07
Stuttering criterion allowed to conclude after 64984 steps with 5520 reset in 109 ms.
Treatment of property HealthRecord-PT-17-LTLFireability-07 finished in 12642 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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||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' '!(X(X(G(!p0))))'
Found a Lengthening insensitive property : HealthRecord-PT-17-LTLFireability-14
Stuttering acceptance computed with spot in 135 ms :[true, p0, p0, p0]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 411/411 places, 548/548 transitions.
Graph (trivial) has 475 edges and 411 vertex of which 78 / 411 are part of one of the 21 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 353 transition count 337
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 156 rules applied. Total rules applied 301 place count 209 transition count 325
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 309 place count 203 transition count 323
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 313 place count 201 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 200 transition count 321
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 314 place count 200 transition count 315
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 326 place count 194 transition count 315
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 355 place count 165 transition count 264
Iterating global reduction 5 with 29 rules applied. Total rules applied 384 place count 165 transition count 264
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 5 rules applied. Total rules applied 389 place count 165 transition count 259
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 394 place count 160 transition count 259
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 405 place count 149 transition count 242
Iterating global reduction 7 with 11 rules applied. Total rules applied 416 place count 149 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 420 place count 149 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 421 place count 148 transition count 238
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 426 place count 143 transition count 231
Iterating global reduction 9 with 5 rules applied. Total rules applied 431 place count 143 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 434 place count 143 transition count 228
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 437 place count 140 transition count 225
Iterating global reduction 10 with 3 rules applied. Total rules applied 440 place count 140 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 443 place count 140 transition count 222
Performed 54 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 11 with 108 rules applied. Total rules applied 551 place count 86 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 557 place count 86 transition count 158
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 564 place count 79 transition count 144
Iterating global reduction 12 with 7 rules applied. Total rules applied 571 place count 79 transition count 144
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 573 place count 77 transition count 141
Iterating global reduction 12 with 2 rules applied. Total rules applied 575 place count 77 transition count 141
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 576 place count 76 transition count 137
Iterating global reduction 12 with 1 rules applied. Total rules applied 577 place count 76 transition count 137
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 585 place count 72 transition count 179
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 586 place count 71 transition count 177
Iterating global reduction 12 with 1 rules applied. Total rules applied 587 place count 71 transition count 177
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 588 place count 70 transition count 173
Iterating global reduction 12 with 1 rules applied. Total rules applied 589 place count 70 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 593 place count 70 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 595 place count 69 transition count 181
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 597 place count 67 transition count 175
Iterating global reduction 13 with 2 rules applied. Total rules applied 599 place count 67 transition count 175
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 600 place count 66 transition count 171
Iterating global reduction 13 with 1 rules applied. Total rules applied 601 place count 66 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 606 place count 66 transition count 166
Applied a total of 606 rules in 36 ms. Remains 66 /411 variables (removed 345) and now considering 166/548 (removed 382) transitions.
[2024-06-01 00:42:52] [INFO ] Flow matrix only has 155 transitions (discarded 11 similar events)
// Phase 1: matrix 155 rows 66 cols
[2024-06-01 00:42:52] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 00:42:52] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 00:42:52] [INFO ] Flow matrix only has 155 transitions (discarded 11 similar events)
[2024-06-01 00:42:52] [INFO ] Invariant cache hit.
[2024-06-01 00:42:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 00:42:52] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-06-01 00:42:52] [INFO ] Flow matrix only has 155 transitions (discarded 11 similar events)
[2024-06-01 00:42:52] [INFO ] Invariant cache hit.
[2024-06-01 00:42:52] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 00:42:53] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:42:53] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:42:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:42:53] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 154/220 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 1/221 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 99 constraints, problems are : Problem set: 0 solved, 151 unsolved in 4164 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 00:42:57] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:42:57] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:42:57] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 154/220 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 19/101 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 151/252 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 1/221 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 11 (OVERLAPS) 0/221 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 253 constraints, problems are : Problem set: 0 solved, 151 unsolved in 6568 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 7/7 constraints]
After SMT, in 10816ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 10817ms
Starting structural reductions in LI_LTL mode, iteration 1 : 66/411 places, 166/548 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10970 ms. Remains : 66/411 places, 166/548 transitions.
Running random walk in product with property : HealthRecord-PT-17-LTLFireability-14
Entered a terminal (fully accepting) state of product in 69 steps with 5 reset in 1 ms.
Treatment of property HealthRecord-PT-17-LTLFireability-14 finished in 11209 ms.
FORMULA HealthRecord-PT-17-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 00:43:03] [INFO ] Flatten gal took : 21 ms
[2024-06-01 00:43:03] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 00:43:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 411 places, 548 transitions and 1303 arcs took 4 ms.
Total runtime 719118 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HealthRecord-PT-17-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : HealthRecord-PT-17-LTLFireability-10
Could not compute solution for formula : HealthRecord-PT-17-LTLFireability-14

BK_STOP 1717203183401

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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
mcc2024
ltl formula name HealthRecord-PT-17-LTLFireability-07
ltl formula formula --ltl=/tmp/3866/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 411 places, 548 transitions and 1303 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3866/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3866/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3866/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3866/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 412 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 412, there are 569 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~118 levels ~10000 states ~29784 transitions
pnml2lts-mc( 1/ 4): ~118 levels ~20000 states ~63016 transitions
pnml2lts-mc( 1/ 4): ~118 levels ~40000 states ~124180 transitions
pnml2lts-mc( 1/ 4): ~123 levels ~80000 states ~256832 transitions
pnml2lts-mc( 1/ 4): ~123 levels ~160000 states ~574352 transitions
pnml2lts-mc( 1/ 4): ~123 levels ~320000 states ~1251744 transitions
pnml2lts-mc( 0/ 4): ~171 levels ~640000 states ~2682440 transitions
pnml2lts-mc( 1/ 4): ~152 levels ~1280000 states ~5353316 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~218!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 983262
pnml2lts-mc( 0/ 4): unique states count: 1525614
pnml2lts-mc( 0/ 4): unique transitions count: 6849267
pnml2lts-mc( 0/ 4): - self-loop count: 2055
pnml2lts-mc( 0/ 4): - claim dead count: 4749166
pnml2lts-mc( 0/ 4): - claim found count: 571280
pnml2lts-mc( 0/ 4): - claim success count: 1525637
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1697
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1525637 states 6849306 transitions, fanout: 4.489
pnml2lts-mc( 0/ 4): Total exploration time 14.470 sec (14.470 sec minimum, 14.470 sec on average)
pnml2lts-mc( 0/ 4): States per second: 105434, Transitions per second: 473345
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 21.7MB, 14.9 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/15.0%
pnml2lts-mc( 0/ 4): Stored 560 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 21.7MB (~256.0MB paged-in)
ltl formula name HealthRecord-PT-17-LTLFireability-10
ltl formula formula --ltl=/tmp/3866/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 411 places, 548 transitions and 1303 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3866/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3866/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3866/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3866/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 412 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 412, there are 556 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~166 levels ~10000 states ~31308 transitions
pnml2lts-mc( 2/ 4): ~166 levels ~20000 states ~55708 transitions
pnml2lts-mc( 2/ 4): ~166 levels ~40000 states ~122608 transitions
pnml2lts-mc( 3/ 4): ~170 levels ~80000 states ~243236 transitions
pnml2lts-mc( 3/ 4): ~172 levels ~160000 states ~520172 transitions
pnml2lts-mc( 2/ 4): ~166 levels ~320000 states ~1162176 transitions
pnml2lts-mc( 1/ 4): ~162 levels ~640000 states ~2620608 transitions
pnml2lts-mc( 3/ 4): ~302 levels ~1280000 states ~5131292 transitions
pnml2lts-mc( 1/ 4): ~210 levels ~2560000 states ~10891908 transitions
pnml2lts-mc( 2/ 4): ~215 levels ~5120000 states ~24417600 transitions
pnml2lts-mc( 3/ 4): ~3981 levels ~10240000 states ~48637160 transitions
pnml2lts-mc( 2/ 4): ~281 levels ~20480000 states ~106932924 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13910706
pnml2lts-mc( 0/ 4): unique states count: 30122355
pnml2lts-mc( 0/ 4): unique transitions count: 164730922
pnml2lts-mc( 0/ 4): - self-loop count: 12491
pnml2lts-mc( 0/ 4): - claim dead count: 120493867
pnml2lts-mc( 0/ 4): - claim found count: 14059030
pnml2lts-mc( 0/ 4): - claim success count: 30122376
pnml2lts-mc( 0/ 4): - cum. max stack depth: 37285
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30122376 states 164730956 transitions, fanout: 5.469
pnml2lts-mc( 0/ 4): Total exploration time 270.650 sec (270.650 sec minimum, 270.650 sec on average)
pnml2lts-mc( 0/ 4): States per second: 111296, Transitions per second: 608649
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 294.0MB, 10.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 89.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 560 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 294.0MB (~256.0MB paged-in)
ltl formula name HealthRecord-PT-17-LTLFireability-14
ltl formula formula --ltl=/tmp/3866/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 411 places, 548 transitions and 1303 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3866/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3866/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3866/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3866/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 413 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 412, there are 554 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~147 levels ~10000 states ~31256 transitions
pnml2lts-mc( 0/ 4): ~147 levels ~20000 states ~58988 transitions
pnml2lts-mc( 0/ 4): ~147 levels ~40000 states ~123980 transitions
pnml2lts-mc( 0/ 4): ~151 levels ~80000 states ~241592 transitions
pnml2lts-mc( 0/ 4): ~151 levels ~160000 states ~551592 transitions
pnml2lts-mc( 0/ 4): ~152 levels ~320000 states ~1156616 transitions
pnml2lts-mc( 0/ 4): ~181 levels ~640000 states ~2582152 transitions
pnml2lts-mc( 2/ 4): ~177 levels ~1280000 states ~5798932 transitions
pnml2lts-mc( 2/ 4): ~261 levels ~2560000 states ~11755600 transitions
pnml2lts-mc( 3/ 4): ~197 levels ~5120000 states ~25958036 transitions
pnml2lts-mc( 3/ 4): ~301 levels ~10240000 states ~55761272 transitions
pnml2lts-mc( 2/ 4): ~37984 levels ~20480000 states ~103529000 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13908377
pnml2lts-mc( 0/ 4): unique states count: 31634327
pnml2lts-mc( 0/ 4): unique transitions count: 177454553
pnml2lts-mc( 0/ 4): - self-loop count: 13316
pnml2lts-mc( 0/ 4): - claim dead count: 126596494
pnml2lts-mc( 0/ 4): - claim found count: 19161953
pnml2lts-mc( 0/ 4): - claim success count: 31634349
pnml2lts-mc( 0/ 4): - cum. max stack depth: 38966
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 31634349 states 177454590 transitions, fanout: 5.610
pnml2lts-mc( 0/ 4): Total exploration time 313.600 sec (313.600 sec minimum, 313.600 sec on average)
pnml2lts-mc( 0/ 4): States per second: 100875, Transitions per second: 565863
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 305.4MB, 10.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 94.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 560 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 305.4MB (~256.0MB paged-in)

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-17"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-PT-17, 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 r496-tall-171640604300828"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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