Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640602400827.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is HealthRecord-PT-17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602400827
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716491740125

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:15:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:15:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:15:41] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-23 19:15:41] [INFO ] Transformed 624 places.
[2024-05-23 19:15:41] [INFO ] Transformed 828 transitions.
[2024-05-23 19:15:41] [INFO ] Found NUPN structural information;
[2024-05-23 19:15:41] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HealthRecord-PT-17-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-LTLCardinality-08 FALSE 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 125 places :
Symmetric choice reduction at 0 with 125 rule applications. Total rules 125 place count 499 transition count 677
Iterating global reduction 0 with 125 rules applied. Total rules applied 250 place count 499 transition count 677
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 302 place count 447 transition count 612
Iterating global reduction 0 with 52 rules applied. Total rules applied 354 place count 447 transition count 612
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 359 place count 447 transition count 607
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 381 place count 425 transition count 567
Iterating global reduction 1 with 22 rules applied. Total rules applied 403 place count 425 transition count 567
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 413 place count 415 transition count 549
Iterating global reduction 1 with 10 rules applied. Total rules applied 423 place count 415 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 425 place count 413 transition count 545
Iterating global reduction 1 with 2 rules applied. Total rules applied 427 place count 413 transition count 545
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 428 place count 412 transition count 543
Iterating global reduction 1 with 1 rules applied. Total rules applied 429 place count 412 transition count 543
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 430 place count 411 transition count 542
Iterating global reduction 1 with 1 rules applied. Total rules applied 431 place count 411 transition count 542
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 432 place count 410 transition count 541
Iterating global reduction 1 with 1 rules applied. Total rules applied 433 place count 410 transition count 541
Applied a total of 433 rules in 165 ms. Remains 410 /624 variables (removed 214) and now considering 541/828 (removed 287) transitions.
// Phase 1: matrix 541 rows 410 cols
[2024-05-23 19:15:41] [INFO ] Computed 18 invariants in 24 ms
[2024-05-23 19:15:42] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-23 19:15:42] [INFO ] Invariant cache hit.
[2024-05-23 19:15:42] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-23 19:15:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-05-23 19:15:49] [INFO ] Deduced a trap composed of 63 places in 167 ms of which 25 ms to minimize.
[2024-05-23 19:15:49] [INFO ] Deduced a trap composed of 50 places in 233 ms of which 3 ms to minimize.
[2024-05-23 19:15:50] [INFO ] Deduced a trap composed of 212 places in 324 ms of which 5 ms to minimize.
[2024-05-23 19:15:50] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 7 ms to minimize.
[2024-05-23 19:15:51] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 3 ms to minimize.
[2024-05-23 19:15:51] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 3 ms to minimize.
[2024-05-23 19:15:51] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 3 ms to minimize.
[2024-05-23 19:15:51] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 3 ms to minimize.
[2024-05-23 19:15:52] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-05-23 19:15:52] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 3 ms to minimize.
[2024-05-23 19:15:52] [INFO ] Deduced a trap composed of 104 places in 176 ms of which 2 ms to minimize.
[2024-05-23 19:15:52] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-05-23 19:15:52] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 2 ms to minimize.
[2024-05-23 19:15:52] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-23 19:15:53] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-05-23 19:15:53] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 3 ms to minimize.
[2024-05-23 19:15:53] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-05-23 19:15:53] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-23 19:15:53] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 2 ms to minimize.
[2024-05-23 19:15:54] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-05-23 19:15:57] [INFO ] Deduced a trap composed of 199 places in 116 ms of which 3 ms to minimize.
[2024-05-23 19:15:58] [INFO ] Deduced a trap composed of 142 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:15:58] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 2 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 2 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 2 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:16:00] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 3 ms to minimize.
[2024-05-23 19:16:01] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 5 ms to minimize.
[2024-05-23 19:16:01] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:16:01] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 2 ms to minimize.
[2024-05-23 19:16:01] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 2 ms to minimize.
[2024-05-23 19:16:01] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:16:01] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 540 unsolved
[2024-05-23 19:16:04] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:16:04] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:16:06] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:16:06] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:16:06] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 540 unsolved
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 30206ms
Starting structural reductions in LTL mode, iteration 1 : 410/624 places, 541/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30997 ms. Remains : 410/624 places, 541/828 transitions.
Support contains 33 out of 410 places after structural reductions.
[2024-05-23 19:16:12] [INFO ] Flatten gal took : 70 ms
[2024-05-23 19:16:12] [INFO ] Flatten gal took : 27 ms
[2024-05-23 19:16:13] [INFO ] Input system was already deterministic with 541 transitions.
Support contains 31 out of 410 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (349 resets) in 1115 ms. (35 steps per ms) remains 13/20 properties
BEST_FIRST walk for 40004 steps (63 resets) in 95 ms. (416 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (57 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (59 resets) in 108 ms. (366 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (59 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (57 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (55 resets) in 59 ms. (666 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (57 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (76 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (60 resets) in 40 ms. (975 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (55 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (59 resets) in 50 ms. (784 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (59 resets) in 38 ms. (1025 steps per ms) remains 12/12 properties
[2024-05-23 19:16:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 107/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 284/410 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 541/951 variables, 410/428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/951 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 951/951 variables, and 428 constraints, problems are : Problem set: 0 solved, 12 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 107/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 19:16:14] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 284/410 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 19:16:15] [INFO ] Deduced a trap composed of 106 places in 295 ms of which 2 ms to minimize.
[2024-05-23 19:16:15] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 1 ms to minimize.
[2024-05-23 19:16:15] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 1 ms to minimize.
[2024-05-23 19:16:15] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:16:15] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 5 ms to minimize.
[2024-05-23 19:16:15] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 1 ms to minimize.
[2024-05-23 19:16:15] [INFO ] Deduced a trap composed of 113 places in 87 ms of which 1 ms to minimize.
[2024-05-23 19:16:16] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-05-23 19:16:16] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:16:16] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 8 ms to minimize.
[2024-05-23 19:16:16] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:16:16] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-05-23 19:16:16] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-05-23 19:16:16] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:16:16] [INFO ] Deduced a trap composed of 107 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:16:16] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:16:16] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 19:16:17] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:16:17] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 2 ms to minimize.
[2024-05-23 19:16:17] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 541/951 variables, 410/449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 19:16:17] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:16:17] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:16:18] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:16:18] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/951 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 19:16:18] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/951 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 19:16:18] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2024-05-23 19:16:18] [INFO ] Deduced a trap composed of 105 places in 61 ms of which 2 ms to minimize.
[2024-05-23 19:16:18] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 2 ms to minimize.
[2024-05-23 19:16:19] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/951 variables, 4/470 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/951 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/951 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 951/951 variables, and 470 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 30/30 constraints]
After SMT, in 5723ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 4 properties in 3617 ms.
Support contains 12 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 541/541 transitions.
Graph (trivial) has 450 edges and 410 vertex of which 70 / 410 are part of one of the 20 SCC in 8 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Graph (complete) has 788 edges and 360 vertex of which 351 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 157 place count 351 transition count 308
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 172 rules applied. Total rules applied 329 place count 196 transition count 291
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 340 place count 187 transition count 289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 342 place count 185 transition count 289
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 342 place count 185 transition count 283
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 354 place count 179 transition count 283
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 368 place count 165 transition count 255
Iterating global reduction 4 with 14 rules applied. Total rules applied 382 place count 165 transition count 255
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 385 place count 165 transition count 252
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 388 place count 162 transition count 252
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 397 place count 153 transition count 240
Iterating global reduction 6 with 9 rules applied. Total rules applied 406 place count 153 transition count 240
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 411 place count 153 transition count 235
Performed 52 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 515 place count 101 transition count 182
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 527 place count 101 transition count 170
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 535 place count 93 transition count 154
Iterating global reduction 8 with 8 rules applied. Total rules applied 543 place count 93 transition count 154
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 544 place count 92 transition count 153
Iterating global reduction 8 with 1 rules applied. Total rules applied 545 place count 92 transition count 153
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 561 place count 84 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 566 place count 84 transition count 191
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 589 place count 84 transition count 168
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 612 place count 61 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 618 place count 61 transition count 162
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 628 place count 61 transition count 162
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 636 place count 61 transition count 162
Applied a total of 636 rules in 141 ms. Remains 61 /410 variables (removed 349) and now considering 162/541 (removed 379) transitions.
Running 158 sub problems to find dead transitions.
[2024-05-23 19:16:23] [INFO ] Flow matrix only has 151 transitions (discarded 11 similar events)
// Phase 1: matrix 151 rows 61 cols
[2024-05-23 19:16:23] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:16:23] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
At refinement iteration 4 (OVERLAPS) 151/212 variables, 61/70 constraints. Problems are: Problem set: 9 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 25/95 constraints. Problems are: Problem set: 9 solved, 149 unsolved
[2024-05-23 19:16:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 1/96 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/96 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/96 constraints. Problems are: Problem set: 10 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 96 constraints, problems are : Problem set: 10 solved, 148 unsolved in 3287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 10 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 3/60 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 8/9 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/10 constraints. Problems are: Problem set: 10 solved, 148 unsolved
[2024-05-23 19:16:27] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/11 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 151/212 variables, 61/72 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 25/97 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 148/245 constraints. Problems are: Problem set: 10 solved, 148 unsolved
[2024-05-23 19:16:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:16:28] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:16:28] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 3/248 constraints. Problems are: Problem set: 10 solved, 148 unsolved
[2024-05-23 19:16:29] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:16:29] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 2/250 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/250 constraints. Problems are: Problem set: 10 solved, 148 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/250 constraints. Problems are: Problem set: 10 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 250 constraints, problems are : Problem set: 10 solved, 148 unsolved in 7199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 148/158 constraints, Known Traps: 7/7 constraints]
After SMT, in 10651ms problems are : Problem set: 10 solved, 148 unsolved
Search for dead transitions found 10 dead transitions in 10652ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/410 places, 152/541 transitions.
Graph (complete) has 258 edges and 61 vertex of which 58 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 58 transition count 147
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 58 transition count 147
Applied a total of 10 rules in 19 ms. Remains 58 /61 variables (removed 3) and now considering 147/152 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10813 ms. Remains : 58/410 places, 147/541 transitions.
RANDOM walk for 40000 steps (4289 resets) in 514 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (876 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (833 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (850 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (820 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (897 resets) in 42 ms. (930 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (954 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (769 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (898 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
Probably explored full state space saw : 150163 states, properties seen :7
Probabilistic random walk after 834656 steps, saw 150163 distinct states, run finished after 1191 ms. (steps per millisecond=700 ) properties seen :7
Explored full state space saw : 150163 states, properties seen :0
Exhaustive walk after 834656 steps, saw 150163 distinct states, run finished after 684 ms. (steps per millisecond=1220 ) properties seen :0
FORMULA HealthRecord-PT-17-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HealthRecord-PT-17-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 114 stabilizing places and 123 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' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 541/541 transitions.
Graph (trivial) has 466 edges and 410 vertex of which 75 / 410 are part of one of the 21 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 153 place count 355 transition count 325
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 169 rules applied. Total rules applied 322 place count 203 transition count 308
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 330 place count 195 transition count 308
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 330 place count 195 transition count 302
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 342 place count 189 transition count 302
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 369 place count 162 transition count 257
Iterating global reduction 3 with 27 rules applied. Total rules applied 396 place count 162 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 401 place count 162 transition count 252
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 404 place count 159 transition count 252
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 415 place count 148 transition count 237
Iterating global reduction 5 with 11 rules applied. Total rules applied 426 place count 148 transition count 237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 433 place count 148 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 434 place count 147 transition count 230
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 436 place count 145 transition count 227
Iterating global reduction 7 with 2 rules applied. Total rules applied 438 place count 145 transition count 227
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 439 place count 144 transition count 225
Iterating global reduction 7 with 1 rules applied. Total rules applied 440 place count 144 transition count 225
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 441 place count 143 transition count 223
Iterating global reduction 7 with 1 rules applied. Total rules applied 442 place count 143 transition count 223
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 443 place count 142 transition count 221
Iterating global reduction 7 with 1 rules applied. Total rules applied 444 place count 142 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 447 place count 142 transition count 218
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 8 with 102 rules applied. Total rules applied 549 place count 91 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 554 place count 91 transition count 158
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 561 place count 84 transition count 144
Iterating global reduction 9 with 7 rules applied. Total rules applied 568 place count 84 transition count 144
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 570 place count 82 transition count 141
Iterating global reduction 9 with 2 rules applied. Total rules applied 572 place count 82 transition count 141
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 573 place count 81 transition count 137
Iterating global reduction 9 with 1 rules applied. Total rules applied 574 place count 81 transition count 137
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -38
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 584 place count 76 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 595 place count 76 transition count 164
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 9 with 2 rules applied. Total rules applied 597 place count 75 transition count 174
Applied a total of 597 rules in 64 ms. Remains 75 /410 variables (removed 335) and now considering 174/541 (removed 367) transitions.
[2024-05-23 19:16:36] [INFO ] Flow matrix only has 164 transitions (discarded 10 similar events)
// Phase 1: matrix 164 rows 75 cols
[2024-05-23 19:16:36] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:16:36] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-23 19:16:36] [INFO ] Flow matrix only has 164 transitions (discarded 10 similar events)
[2024-05-23 19:16:36] [INFO ] Invariant cache hit.
[2024-05-23 19:16:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 19:16:36] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-23 19:16:37] [INFO ] Redundant transitions in 18 ms returned []
Running 170 sub problems to find dead transitions.
[2024-05-23 19:16:37] [INFO ] Flow matrix only has 164 transitions (discarded 10 similar events)
[2024-05-23 19:16:37] [INFO ] Invariant cache hit.
[2024-05-23 19:16:37] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-23 19:16:37] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:16:37] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:16:38] [INFO ] Deduced a trap composed of 21 places in 36 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, 170 unsolved
[2024-05-23 19:16:38] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:16:38] [INFO ] Deduced a trap composed of 19 places in 30 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, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 163/238 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 1/239 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 104 constraints, problems are : Problem set: 0 solved, 170 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 163/238 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 170/273 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 1/239 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 274 constraints, problems are : Problem set: 0 solved, 170 unsolved in 7845 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 5/5 constraints]
After SMT, in 13001ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 13003ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/410 places, 174/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13288 ms. Remains : 75/410 places, 174/541 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-00
Product exploration explored 100000 steps with 7538 reset in 249 ms.
Product exploration explored 100000 steps with 7505 reset in 192 ms.
Computed a total of 5 stabilizing places and 25 stable transitions
Computed a total of 5 stabilizing places and 25 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 p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 207 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3350 resets) in 607 ms. (65 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (281 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2024-05-23 19:16:51] [INFO ] Flow matrix only has 164 transitions (discarded 10 similar events)
[2024-05-23 19:16:51] [INFO ] Invariant cache hit.
[2024-05-23 19:16:51] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/75 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 163/238 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/239 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 37/239 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 5/9 constraints, State Equation: 0/75 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
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 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 12 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-17-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLCardinality-00 finished in 14612 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)||X(p1)))))'
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 541/541 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 396 transition count 524
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 396 transition count 524
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 385 transition count 507
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 385 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 385 transition count 506
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 377 transition count 493
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 377 transition count 493
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 370 transition count 485
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 370 transition count 485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 365 transition count 477
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 365 transition count 477
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 94 place count 365 transition count 474
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 363 transition count 471
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 363 transition count 471
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 363 transition count 468
Applied a total of 101 rules in 35 ms. Remains 363 /410 variables (removed 47) and now considering 468/541 (removed 73) transitions.
// Phase 1: matrix 468 rows 363 cols
[2024-05-23 19:16:51] [INFO ] Computed 18 invariants in 3 ms
[2024-05-23 19:16:51] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-23 19:16:51] [INFO ] Invariant cache hit.
[2024-05-23 19:16:51] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-23 19:16:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:16:56] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-23 19:16:57] [INFO ] Deduced a trap composed of 136 places in 101 ms of which 2 ms to minimize.
[2024-05-23 19:16:57] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-23 19:16:57] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-23 19:16:57] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-05-23 19:16:57] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 2 ms to minimize.
[2024-05-23 19:16:58] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 3 ms to minimize.
[2024-05-23 19:16:58] [INFO ] Deduced a trap composed of 191 places in 104 ms of which 3 ms to minimize.
[2024-05-23 19:16:58] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:16:58] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 2 ms to minimize.
[2024-05-23 19:16:58] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:16:58] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2024-05-23 19:16:58] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:16:59] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:16:59] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:17:00] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-23 19:17:00] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:17:00] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:17:00] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:17:00] [INFO ] Deduced a trap composed of 65 places in 74 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, 467 unsolved
[2024-05-23 19:17:04] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-23 19:17:04] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-05-23 19:17:04] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:17:04] [INFO ] Deduced a trap composed of 117 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:17:05] [INFO ] Deduced a trap composed of 140 places in 90 ms of which 2 ms to minimize.
[2024-05-23 19:17:05] [INFO ] Deduced a trap composed of 109 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:17:05] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:17:05] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:17:05] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-23 19:17:05] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:17:06] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:17:06] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:17:06] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:17:06] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:17:06] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:17:07] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-05-23 19:17:07] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:17:10] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:17:11] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:17:14] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/831 variables, and 58 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/363 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 40/58 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:17:24] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 3 ms to minimize.
[2024-05-23 19:17:24] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 3 ms to minimize.
[2024-05-23 19:17:25] [INFO ] Deduced a trap composed of 135 places in 101 ms of which 2 ms to minimize.
[2024-05-23 19:17:27] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:17:27] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:17:29] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:17:29] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:17:29] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:17:29] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:17:32] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:17:34] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 3 ms to minimize.
[2024-05-23 19:17:34] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:17:34] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-23 19:17:34] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:17:34] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 2 ms to minimize.
[2024-05-23 19:17:34] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:17:35] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-23 19:17:35] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:17:36] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-23 19:17:36] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:17:37] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:17:39] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-23 19:17:39] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 9 (OVERLAPS) 468/831 variables, 363/444 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 467/911 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 831/831 variables, and 911 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 63/63 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 363/410 places, 468/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60468 ms. Remains : 363/410 places, 468/541 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-03
Product exploration explored 100000 steps with 25000 reset in 426 ms.
Product exploration explored 100000 steps with 25000 reset in 109 ms.
Computed a total of 112 stabilizing places and 120 stable transitions
Computed a total of 112 stabilizing places and 120 stable transitions
Detected a total of 112/363 stabilizing places and 120/468 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 128 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 363 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 468/468 transitions.
Applied a total of 0 rules in 8 ms. Remains 363 /363 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-05-23 19:17:53] [INFO ] Invariant cache hit.
[2024-05-23 19:17:53] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 19:17:53] [INFO ] Invariant cache hit.
[2024-05-23 19:17:53] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-23 19:17:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:17:58] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-23 19:17:59] [INFO ] Deduced a trap composed of 136 places in 95 ms of which 4 ms to minimize.
[2024-05-23 19:17:59] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-23 19:17:59] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-23 19:17:59] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:18:00] [INFO ] Deduced a trap composed of 135 places in 101 ms of which 2 ms to minimize.
[2024-05-23 19:18:00] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-23 19:18:00] [INFO ] Deduced a trap composed of 191 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:18:00] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-23 19:18:00] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:18:00] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:18:00] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-23 19:18:01] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2024-05-23 19:18:02] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:18:02] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:18:02] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:18:02] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:18:02] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 2 ms to minimize.
[2024-05-23 19:18:02] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:18:03] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:18:06] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-23 19:18:06] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-23 19:18:06] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:18:07] [INFO ] Deduced a trap composed of 117 places in 99 ms of which 2 ms to minimize.
[2024-05-23 19:18:07] [INFO ] Deduced a trap composed of 140 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:18:07] [INFO ] Deduced a trap composed of 109 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:18:07] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:18:07] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:18:07] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:18:07] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:18:08] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:18:08] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:18:08] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:18:08] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:18:08] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-23 19:18:09] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-05-23 19:18:09] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:18:12] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:18:13] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:18:16] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 467 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/831 variables, and 58 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/363 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 40/58 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:18:26] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-23 19:18:26] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-23 19:18:27] [INFO ] Deduced a trap composed of 135 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:18:29] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:18:29] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:18:31] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 1 ms to minimize.
[2024-05-23 19:18:31] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:18:31] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:18:31] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:18:33] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:18:35] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-05-23 19:18:36] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-23 19:18:36] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-23 19:18:36] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:18:36] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 3 ms to minimize.
[2024-05-23 19:18:36] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:18:36] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 3 ms to minimize.
[2024-05-23 19:18:37] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:18:38] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-23 19:18:38] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 3 ms to minimize.
[2024-05-23 19:18:38] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:18:40] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-23 19:18:41] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 9 (OVERLAPS) 468/831 variables, 363/444 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 467/911 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 831/831 variables, and 911 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 63/63 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in LTL mode , in 1 iterations and 60389 ms. Remains : 363/363 places, 468/468 transitions.
Computed a total of 112 stabilizing places and 120 stable transitions
Computed a total of 112 stabilizing places and 120 stable transitions
Detected a total of 112/363 stabilizing places and 120/468 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 148 steps (0 resets) in 4 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 98 ms.
Product exploration explored 100000 steps with 25000 reset in 104 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 468/468 transitions.
Graph (trivial) has 409 edges and 363 vertex of which 60 / 363 are part of one of the 21 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 140 rules applied. Total rules applied 141 place count 324 transition count 423
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 149 place count 324 transition count 416
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 149 place count 324 transition count 416
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 324 transition count 416
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 248 place count 228 transition count 314
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 344 place count 228 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 348 place count 224 transition count 310
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 352 place count 224 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 355 place count 224 transition count 307
Performed 59 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 122 places in 0 ms
Iterating global reduction 3 with 59 rules applied. Total rules applied 414 place count 224 transition count 334
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 422 place count 224 transition count 326
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 477 place count 169 transition count 255
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 4 with 55 rules applied. Total rules applied 532 place count 169 transition count 255
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 537 place count 164 transition count 248
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 542 place count 164 transition count 248
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 548 place count 158 transition count 230
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 554 place count 158 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 557 place count 158 transition count 227
Performed 17 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 17 rules applied. Total rules applied 574 place count 158 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 575 place count 158 transition count 343
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 596 place count 137 transition count 296
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 6 with 21 rules applied. Total rules applied 617 place count 137 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 618 place count 137 transition count 317
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 619 place count 136 transition count 313
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 620 place count 136 transition count 313
Deduced a syphon composed of 68 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 638 place count 136 transition count 295
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 641 place count 133 transition count 288
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 644 place count 133 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 645 place count 133 transition count 303
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 648 place count 130 transition count 296
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 651 place count 130 transition count 296
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 654 place count 127 transition count 291
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 657 place count 127 transition count 291
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 658 place count 126 transition count 290
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 659 place count 126 transition count 290
Deduced a syphon composed of 63 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 662 place count 126 transition count 287
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 662 rules in 91 ms. Remains 126 /363 variables (removed 237) and now considering 287/468 (removed 181) transitions.
[2024-05-23 19:18:55] [INFO ] Redundant transitions in 72 ms returned []
Running 279 sub problems to find dead transitions.
[2024-05-23 19:18:55] [INFO ] Flow matrix only has 277 transitions (discarded 10 similar events)
// Phase 1: matrix 277 rows 126 cols
[2024-05-23 19:18:55] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:18:55] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-23 19:18:56] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:18:56] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:18:56] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:18:56] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:18:56] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-05-23 19:18:56] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-23 19:18:56] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-05-23 19:18:57] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-23 19:18:57] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-05-23 19:18:57] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:18:57] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-23 19:18:57] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-23 19:18:57] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
[2024-05-23 19:18:57] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-23 19:18:57] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/24 constraints. Problems are: Problem set: 101 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/24 constraints. Problems are: Problem set: 101 solved, 178 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 TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 4 (OVERLAPS) 276/402 variables, 126/150 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 22/172 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/172 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 1/403 variables, 1/173 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/173 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 0/403 variables, 0/173 constraints. Problems are: Problem set: 122 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 173 constraints, problems are : Problem set: 122 solved, 157 unsolved in 7994 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 126/126 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 122 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 64/126 variables, 9/9 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/24 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/24 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 276/402 variables, 126/150 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 22/172 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 157/329 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/329 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 1/403 variables, 1/330 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/330 constraints. Problems are: Problem set: 122 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/403 variables, 0/330 constraints. Problems are: Problem set: 122 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 330 constraints, problems are : Problem set: 122 solved, 157 unsolved in 12724 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 126/126 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 157/279 constraints, Known Traps: 15/15 constraints]
After SMT, in 20879ms problems are : Problem set: 122 solved, 157 unsolved
Search for dead transitions found 122 dead transitions in 20882ms
Found 122 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 122 transitions
Dead transitions reduction (with SMT) removed 122 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 126/363 places, 165/468 transitions.
Graph (complete) has 256 edges and 126 vertex of which 63 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.1 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 63 /126 variables (removed 63) and now considering 165/165 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/363 places, 165/468 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21062 ms. Remains : 63/363 places, 165/468 transitions.
Support contains 2 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 468/468 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 362 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 362 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 361 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 361 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 360 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 360 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 359 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 359 transition count 464
Applied a total of 8 rules in 26 ms. Remains 359 /363 variables (removed 4) and now considering 464/468 (removed 4) transitions.
// Phase 1: matrix 464 rows 359 cols
[2024-05-23 19:19:16] [INFO ] Computed 18 invariants in 6 ms
[2024-05-23 19:19:16] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-23 19:19:16] [INFO ] Invariant cache hit.
[2024-05-23 19:19:16] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2024-05-23 19:19:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/359 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-23 19:19:21] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-05-23 19:19:21] [INFO ] Deduced a trap composed of 136 places in 103 ms of which 2 ms to minimize.
[2024-05-23 19:19:21] [INFO ] Deduced a trap composed of 135 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:19:22] [INFO ] Deduced a trap composed of 150 places in 100 ms of which 3 ms to minimize.
[2024-05-23 19:19:22] [INFO ] Deduced a trap composed of 134 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:19:22] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 3 ms to minimize.
[2024-05-23 19:19:22] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-23 19:19:22] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:19:23] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-23 19:19:23] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:19:23] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-05-23 19:19:23] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:19:23] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-05-23 19:19:25] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-23 19:19:25] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-05-23 19:19:25] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-23 19:19:25] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:19:25] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-23 19:19:25] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:19:25] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-23 19:19:28] [INFO ] Deduced a trap composed of 192 places in 104 ms of which 3 ms to minimize.
[2024-05-23 19:19:31] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:19:31] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2024-05-23 19:19:31] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:19:31] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:19:31] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:19:31] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:19:32] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 3 ms to minimize.
[2024-05-23 19:19:32] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-23 19:19:33] [INFO ] Deduced a trap composed of 126 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:19:33] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 3 ms to minimize.
[2024-05-23 19:19:34] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-23 19:19:34] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:19:34] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-23 19:19:34] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2024-05-23 19:19:35] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:19:35] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:19:35] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:19:35] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:19:35] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:19:36] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:19:36] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:19:36] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2024-05-23 19:19:36] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:19:36] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:19:36] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:19:37] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:19:37] [INFO ] Deduced a trap composed of 112 places in 102 ms of which 2 ms to minimize.
[2024-05-23 19:19:37] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 7 (OVERLAPS) 464/823 variables, 359/426 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-23 19:19:45] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:19:45] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 428 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/359 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 51/69 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-23 19:19:49] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:19:50] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:19:50] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-23 19:19:51] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:19:51] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:19:51] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 6 (OVERLAPS) 464/823 variables, 359/434 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 463/897 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-23 19:19:59] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-05-23 19:20:00] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:20:00] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:20:00] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 1 ms to minimize.
[2024-05-23 19:20:04] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:20:04] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:20:06] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 7/904 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-05-23 19:20:12] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-23 19:20:12] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 906 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 66/66 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 359/363 places, 464/468 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60456 ms. Remains : 359/363 places, 464/468 transitions.
Treatment of property HealthRecord-PT-17-LTLCardinality-03 finished in 205355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 541/541 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 396 transition count 524
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 396 transition count 524
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 40 place count 384 transition count 507
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 384 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 384 transition count 505
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 376 transition count 492
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 376 transition count 492
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 369 transition count 484
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 369 transition count 484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 365 transition count 479
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 365 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 365 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 364 transition count 475
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 364 transition count 475
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 364 transition count 472
Applied a total of 99 rules in 31 ms. Remains 364 /410 variables (removed 46) and now considering 472/541 (removed 69) transitions.
// Phase 1: matrix 472 rows 364 cols
[2024-05-23 19:20:16] [INFO ] Computed 18 invariants in 3 ms
[2024-05-23 19:20:16] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-23 19:20:16] [INFO ] Invariant cache hit.
[2024-05-23 19:20:17] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-05-23 19:20:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-23 19:20:22] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 3 ms to minimize.
[2024-05-23 19:20:22] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 3 ms to minimize.
[2024-05-23 19:20:22] [INFO ] Deduced a trap composed of 136 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:20:22] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 2 ms to minimize.
[2024-05-23 19:20:23] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-23 19:20:23] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-05-23 19:20:23] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:20:23] [INFO ] Deduced a trap composed of 195 places in 104 ms of which 2 ms to minimize.
[2024-05-23 19:20:23] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-05-23 19:20:24] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-23 19:20:24] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:20:24] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-23 19:20:24] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:20:24] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:20:25] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:20:25] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:20:25] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:20:26] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:20:26] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:20:26] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-23 19:20:29] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-05-23 19:20:30] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-23 19:20:30] [INFO ] Deduced a trap composed of 127 places in 92 ms of which 2 ms to minimize.
[2024-05-23 19:20:30] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:20:30] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:20:30] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:20:30] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:20:31] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:20:32] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:20:32] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:20:32] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-23 19:20:32] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:20:32] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:20:33] [INFO ] Deduced a trap composed of 195 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:20:34] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-23 19:20:36] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:20:36] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:20:37] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:20:37] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-23 19:20:40] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 3 ms to minimize.
[2024-05-23 19:20:41] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:20:41] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:20:41] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:20:41] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-23 19:20:41] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:20:42] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-23 19:20:46] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2024-05-23 19:20:46] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 2 ms to minimize.
[2024-05-23 19:20:46] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/836 variables, and 67 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-23 19:20:50] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-05-23 19:20:50] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-23 19:20:56] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2024-05-23 19:20:57] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-23 19:20:58] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:21:00] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 2 ms to minimize.
[2024-05-23 19:21:00] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:21:00] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:21:00] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-23 19:21:01] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:21:01] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 8 (OVERLAPS) 472/836 variables, 364/442 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/836 variables, 471/913 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-05-23 19:21:14] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/836 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/836 variables, and 914 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 61/61 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 364/410 places, 472/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60560 ms. Remains : 364/410 places, 472/541 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-04
Product exploration explored 100000 steps with 878 reset in 188 ms.
Product exploration explored 100000 steps with 881 reset in 118 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (348 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (57 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1554907 steps, run timeout after 3001 ms. (steps per millisecond=518 ) properties seen :0 out of 1
Probabilistic random walk after 1554907 steps, saw 310396 distinct states, run finished after 3004 ms. (steps per millisecond=517 ) properties seen :0
[2024-05-23 19:21:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/185 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 179/364 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 472/836 variables, 364/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/836 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/836 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 382 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 364/364 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/185 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:21:21] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-23 19:21:21] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 179/364 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 472/836 variables, 364/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/836 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:21:21] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:21:21] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/836 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/836 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/836 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 472/472 transitions.
Graph (trivial) has 411 edges and 364 vertex of which 63 / 364 are part of one of the 21 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Graph (complete) has 703 edges and 322 vertex of which 286 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 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 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 199 rules applied. Total rules applied 201 place count 286 transition count 187
Reduce places removed 141 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 154 rules applied. Total rules applied 355 place count 145 transition count 174
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 362 place count 138 transition count 174
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 362 place count 138 transition count 155
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 400 place count 119 transition count 155
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 422 place count 97 transition count 133
Iterating global reduction 3 with 22 rules applied. Total rules applied 444 place count 97 transition count 133
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 444 place count 97 transition count 126
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 458 place count 90 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 462 place count 86 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 466 place count 86 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 469 place count 86 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 470 place count 85 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 471 place count 85 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 476 place count 80 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 481 place count 80 transition count 113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 486 place count 80 transition count 108
Performed 32 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 550 place count 48 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 552 place count 48 transition count 67
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 556 place count 44 transition count 63
Iterating global reduction 6 with 4 rules applied. Total rules applied 560 place count 44 transition count 63
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 561 place count 43 transition count 61
Iterating global reduction 6 with 1 rules applied. Total rules applied 562 place count 43 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 566 place count 41 transition count 59
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 567 place count 40 transition count 58
Iterating global reduction 6 with 1 rules applied. Total rules applied 568 place count 40 transition count 58
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 574 place count 37 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 584 place count 37 transition count 62
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 585 place count 36 transition count 61
Iterating global reduction 6 with 1 rules applied. Total rules applied 586 place count 36 transition count 61
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 589 place count 33 transition count 58
Iterating global reduction 6 with 3 rules applied. Total rules applied 592 place count 33 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 594 place count 32 transition count 66
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 597 place count 32 transition count 63
Free-agglomeration rule applied 7 times with reduction of 1 identical transitions.
Iterating global reduction 6 with 7 rules applied. Total rules applied 604 place count 32 transition count 55
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 611 place count 25 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 612 place count 25 transition count 54
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 614 place count 25 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 616 place count 25 transition count 52
Applied a total of 616 rules in 36 ms. Remains 25 /364 variables (removed 339) and now considering 52/472 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 25/364 places, 52/472 transitions.
RANDOM walk for 27001 steps (3845 resets) in 59 ms. (450 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-17-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLCardinality-04 finished in 65016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 541/541 transitions.
Graph (trivial) has 468 edges and 410 vertex of which 75 / 410 are part of one of the 21 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 156 place count 355 transition count 322
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 172 rules applied. Total rules applied 328 place count 200 transition count 305
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 336 place count 192 transition count 305
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 336 place count 192 transition count 300
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 346 place count 187 transition count 300
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 374 place count 159 transition count 253
Iterating global reduction 3 with 28 rules applied. Total rules applied 402 place count 159 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 408 place count 159 transition count 247
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 412 place count 155 transition count 247
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 424 place count 143 transition count 230
Iterating global reduction 5 with 12 rules applied. Total rules applied 436 place count 143 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 443 place count 143 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 444 place count 142 transition count 223
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 446 place count 140 transition count 220
Iterating global reduction 7 with 2 rules applied. Total rules applied 448 place count 140 transition count 220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 449 place count 139 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 450 place count 139 transition count 218
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 451 place count 138 transition count 216
Iterating global reduction 7 with 1 rules applied. Total rules applied 452 place count 138 transition count 216
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 453 place count 137 transition count 214
Iterating global reduction 7 with 1 rules applied. Total rules applied 454 place count 137 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 457 place count 137 transition count 211
Performed 50 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 8 with 100 rules applied. Total rules applied 557 place count 87 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 562 place count 87 transition count 152
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 569 place count 80 transition count 138
Iterating global reduction 9 with 7 rules applied. Total rules applied 576 place count 80 transition count 138
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 578 place count 78 transition count 135
Iterating global reduction 9 with 2 rules applied. Total rules applied 580 place count 78 transition count 135
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 581 place count 77 transition count 131
Iterating global reduction 9 with 1 rules applied. Total rules applied 582 place count 77 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -50
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 590 place count 73 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 612 place count 73 transition count 159
Applied a total of 612 rules in 44 ms. Remains 73 /410 variables (removed 337) and now considering 159/541 (removed 382) transitions.
[2024-05-23 19:21:21] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
// Phase 1: matrix 149 rows 73 cols
[2024-05-23 19:21:21] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 19:21:21] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-23 19:21:21] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
[2024-05-23 19:21:21] [INFO ] Invariant cache hit.
[2024-05-23 19:21:21] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-23 19:21:21] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-23 19:21:21] [INFO ] Redundant transitions in 11 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-23 19:21:21] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
[2024-05-23 19:21:21] [INFO ] Invariant cache hit.
[2024-05-23 19:21:21] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-23 19:21:22] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:21:22] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 148/221 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 15/99 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 1/222 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 100 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-23 19:21:26] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 148/221 variables, 73/85 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 143/243 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/222 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 244 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6413 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 3/3 constraints]
After SMT, in 10515ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 10517ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/410 places, 159/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10773 ms. Remains : 73/410 places, 159/541 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-07 finished in 10864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&F(p1))))&&F(p2)))'
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 541/541 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 394 transition count 522
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 394 transition count 522
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 45 place count 381 transition count 503
Iterating global reduction 0 with 13 rules applied. Total rules applied 58 place count 381 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 381 transition count 501
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 69 place count 372 transition count 487
Iterating global reduction 1 with 9 rules applied. Total rules applied 78 place count 372 transition count 487
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 365 transition count 480
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 365 transition count 480
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 361 transition count 474
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 361 transition count 474
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 103 place count 361 transition count 471
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 360 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 360 transition count 470
Applied a total of 105 rules in 41 ms. Remains 360 /410 variables (removed 50) and now considering 470/541 (removed 71) transitions.
// Phase 1: matrix 470 rows 360 cols
[2024-05-23 19:21:32] [INFO ] Computed 18 invariants in 10 ms
[2024-05-23 19:21:32] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-23 19:21:32] [INFO ] Invariant cache hit.
[2024-05-23 19:21:32] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2024-05-23 19:21:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-23 19:21:38] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 3 ms to minimize.
[2024-05-23 19:21:38] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 2 ms to minimize.
[2024-05-23 19:21:38] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-23 19:21:38] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-23 19:21:38] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-23 19:21:39] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:21:39] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
[2024-05-23 19:21:39] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 3 ms to minimize.
[2024-05-23 19:21:39] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-23 19:21:39] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 3 ms to minimize.
[2024-05-23 19:21:40] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:21:40] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
[2024-05-23 19:21:40] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 2 ms to minimize.
[2024-05-23 19:21:40] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-05-23 19:21:40] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 2 ms to minimize.
[2024-05-23 19:21:40] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-23 19:21:40] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:21:40] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:21:41] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-05-23 19:21:41] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-23 19:21:44] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-23 19:21:44] [INFO ] Deduced a trap composed of 138 places in 95 ms of which 3 ms to minimize.
[2024-05-23 19:21:46] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:21:46] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:21:46] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:21:46] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-23 19:21:46] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:21:47] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:21:47] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:21:48] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:21:48] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-23 19:21:49] [INFO ] Deduced a trap composed of 192 places in 96 ms of which 2 ms to minimize.
[2024-05-23 19:21:49] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:21:50] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:21:50] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:21:50] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:21:50] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:21:50] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 2 ms to minimize.
[2024-05-23 19:21:51] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 2 ms to minimize.
[2024-05-23 19:21:51] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-23 19:21:53] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:21:53] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-23 19:21:54] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:21:54] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-05-23 19:21:54] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-23 19:21:54] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:21:55] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-23 19:22:00] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-23 19:22:02] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/830 variables, and 67 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: 0/360 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-23 19:22:06] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2024-05-23 19:22:07] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:22:07] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:22:07] [INFO ] Deduced a trap composed of 111 places in 83 ms of which 2 ms to minimize.
[2024-05-23 19:22:07] [INFO ] Deduced a trap composed of 109 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:22:08] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-23 19:22:10] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-23 19:22:12] [INFO ] Deduced a trap composed of 191 places in 90 ms of which 2 ms to minimize.
[2024-05-23 19:22:13] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:22:13] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 7 (OVERLAPS) 470/830 variables, 360/437 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/830 variables, 469/906 constraints. Problems are: Problem set: 0 solved, 469 unsolved
[2024-05-23 19:22:28] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 2 ms to minimize.
[2024-05-23 19:22:28] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 2/908 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 830/830 variables, and 908 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 61/61 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 469 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 360/410 places, 470/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60494 ms. Remains : 360/410 places, 470/541 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-11
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-17-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-LTLCardinality-11 finished in 60697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 541/541 transitions.
Graph (trivial) has 468 edges and 410 vertex of which 75 / 410 are part of one of the 21 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 156 place count 355 transition count 322
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 173 rules applied. Total rules applied 329 place count 200 transition count 304
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 338 place count 191 transition count 304
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 338 place count 191 transition count 299
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 186 transition count 299
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 376 place count 158 transition count 252
Iterating global reduction 3 with 28 rules applied. Total rules applied 404 place count 158 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 410 place count 158 transition count 246
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 414 place count 154 transition count 246
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 426 place count 142 transition count 229
Iterating global reduction 5 with 12 rules applied. Total rules applied 438 place count 142 transition count 229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 445 place count 142 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 446 place count 141 transition count 222
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 448 place count 139 transition count 219
Iterating global reduction 7 with 2 rules applied. Total rules applied 450 place count 139 transition count 219
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 451 place count 138 transition count 217
Iterating global reduction 7 with 1 rules applied. Total rules applied 452 place count 138 transition count 217
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 453 place count 137 transition count 215
Iterating global reduction 7 with 1 rules applied. Total rules applied 454 place count 137 transition count 215
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 455 place count 136 transition count 213
Iterating global reduction 7 with 1 rules applied. Total rules applied 456 place count 136 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 459 place count 136 transition count 210
Performed 49 Post agglomeration using F-continuation condition with reduction of 4 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 557 place count 87 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 562 place count 87 transition count 152
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 569 place count 80 transition count 138
Iterating global reduction 9 with 7 rules applied. Total rules applied 576 place count 80 transition count 138
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 578 place count 78 transition count 135
Iterating global reduction 9 with 2 rules applied. Total rules applied 580 place count 78 transition count 135
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 581 place count 77 transition count 131
Iterating global reduction 9 with 1 rules applied. Total rules applied 582 place count 77 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
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 590 place count 73 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 608 place count 73 transition count 149
Applied a total of 608 rules in 44 ms. Remains 73 /410 variables (removed 337) and now considering 149/541 (removed 392) transitions.
[2024-05-23 19:22:33] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
// Phase 1: matrix 139 rows 73 cols
[2024-05-23 19:22:33] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 19:22:33] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-23 19:22:33] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-05-23 19:22:33] [INFO ] Invariant cache hit.
[2024-05-23 19:22:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 19:22:33] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-23 19:22:33] [INFO ] Redundant transitions in 10 ms returned []
Running 141 sub problems to find dead transitions.
[2024-05-23 19:22:33] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-05-23 19:22:33] [INFO ] Invariant cache hit.
[2024-05-23 19:22:33] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:22:34] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-23 19:22:34] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:22:34] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 138/211 variables, 73/85 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 1/212 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 99 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3704 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:22:37] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 138/211 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 141/240 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 1/212 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/212 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 241 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5925 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 4/4 constraints]
After SMT, in 9709ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 9710ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/410 places, 149/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9971 ms. Remains : 73/410 places, 149/541 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-12
Product exploration explored 100000 steps with 7892 reset in 151 ms.
Product exploration explored 100000 steps with 7858 reset in 150 ms.
Computed a total of 3 stabilizing places and 12 stable transitions
Computed a total of 3 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3541 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (294 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3470782 steps, run timeout after 3001 ms. (steps per millisecond=1156 ) properties seen :0 out of 1
Probabilistic random walk after 3470782 steps, saw 509862 distinct states, run finished after 3001 ms. (steps per millisecond=1156 ) properties seen :0
[2024-05-23 19:22:46] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-05-23 19:22:46] [INFO ] Invariant cache hit.
[2024-05-23 19:22:46] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/73 variables, 7/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) 138/211 variables, 73/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/212 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/73 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:22:46] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/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) 138/211 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:22:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:22:46] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/212 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 260ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 149/149 transitions.
Graph (complete) has 257 edges and 73 vertex of which 53 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 53 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 19 place count 53 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 52 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 51 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 51 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 50 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 50 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 48 transition count 105
Free-agglomeration rule applied 24 times with reduction of 4 identical transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 53 place count 48 transition count 77
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 81 place count 24 transition count 73
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 21 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 21 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 21 transition count 58
Applied a total of 93 rules in 10 ms. Remains 21 /73 variables (removed 52) and now considering 58/149 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 21/73 places, 58/149 transitions.
RANDOM walk for 28387 steps (5002 resets) in 49 ms. (567 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 149/149 transitions.
Applied a total of 0 rules in 7 ms. Remains 73 /73 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-05-23 19:22:47] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-05-23 19:22:47] [INFO ] Invariant cache hit.
[2024-05-23 19:22:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 19:22:47] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-05-23 19:22:47] [INFO ] Invariant cache hit.
[2024-05-23 19:22:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 19:22:47] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-23 19:22:47] [INFO ] Redundant transitions in 11 ms returned []
Running 141 sub problems to find dead transitions.
[2024-05-23 19:22:47] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-05-23 19:22:47] [INFO ] Invariant cache hit.
[2024-05-23 19:22:47] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:22:47] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-23 19:22:47] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:22:48] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 138/211 variables, 73/85 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 1/212 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 99 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3816 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:22:51] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 138/211 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 141/240 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 1/212 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/212 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 241 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6125 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 4/4 constraints]
After SMT, in 10005ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 10008ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10166 ms. Remains : 73/73 places, 149/149 transitions.
Computed a total of 3 stabilizing places and 12 stable transitions
Computed a total of 3 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3521 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (303 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3503349 steps, run timeout after 3001 ms. (steps per millisecond=1167 ) properties seen :0 out of 1
Probabilistic random walk after 3503349 steps, saw 514818 distinct states, run finished after 3001 ms. (steps per millisecond=1167 ) properties seen :0
[2024-05-23 19:23:00] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-05-23 19:23:00] [INFO ] Invariant cache hit.
[2024-05-23 19:23:00] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/73 variables, 7/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) 138/211 variables, 73/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/212 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/73 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:23:00] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/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) 138/211 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 19:23:00] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:23:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/212 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 275ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 149/149 transitions.
Graph (complete) has 257 edges and 73 vertex of which 53 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 53 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 19 place count 53 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 52 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 51 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 51 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 50 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 50 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 48 transition count 105
Free-agglomeration rule applied 24 times with reduction of 4 identical transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 53 place count 48 transition count 77
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 81 place count 24 transition count 73
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 21 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 21 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 21 transition count 58
Applied a total of 93 rules in 10 ms. Remains 21 /73 variables (removed 52) and now considering 58/149 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 21/73 places, 58/149 transitions.
RANDOM walk for 31322 steps (5518 resets) in 54 ms. (569 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7877 reset in 144 ms.
Product exploration explored 100000 steps with 7878 reset in 151 ms.
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 149/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-05-23 19:23:01] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-05-23 19:23:01] [INFO ] Invariant cache hit.
[2024-05-23 19:23:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-23 19:23:01] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-05-23 19:23:01] [INFO ] Invariant cache hit.
[2024-05-23 19:23:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-23 19:23:01] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-23 19:23:01] [INFO ] Redundant transitions in 11 ms returned []
Running 141 sub problems to find dead transitions.
[2024-05-23 19:23:01] [INFO ] Flow matrix only has 139 transitions (discarded 10 similar events)
[2024-05-23 19:23:01] [INFO ] Invariant cache hit.
[2024-05-23 19:23:01] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:23:02] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-23 19:23:02] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:23:02] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 138/211 variables, 73/85 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 1/212 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 99 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3814 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-23 19:23:05] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 138/211 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 141/240 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 1/212 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/212 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 241 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6068 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 4/4 constraints]
After SMT, in 9952ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 9954ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10121 ms. Remains : 73/73 places, 149/149 transitions.
Treatment of property HealthRecord-PT-17-LTLCardinality-12 finished in 38219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 541/541 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 396 transition count 524
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 396 transition count 524
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 40 place count 384 transition count 506
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 384 transition count 506
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 384 transition count 504
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 376 transition count 493
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 376 transition count 493
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 368 transition count 484
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 368 transition count 484
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 363 transition count 476
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 363 transition count 476
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 363 transition count 473
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 362 transition count 471
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 362 transition count 471
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 362 transition count 468
Applied a total of 104 rules in 28 ms. Remains 362 /410 variables (removed 48) and now considering 468/541 (removed 73) transitions.
// Phase 1: matrix 468 rows 362 cols
[2024-05-23 19:23:11] [INFO ] Computed 18 invariants in 1 ms
[2024-05-23 19:23:11] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-23 19:23:11] [INFO ] Invariant cache hit.
[2024-05-23 19:23:11] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-23 19:23:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:23:16] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 3 ms to minimize.
[2024-05-23 19:23:16] [INFO ] Deduced a trap composed of 134 places in 103 ms of which 2 ms to minimize.
[2024-05-23 19:23:17] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 2 ms to minimize.
[2024-05-23 19:23:17] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 3 ms to minimize.
[2024-05-23 19:23:17] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:23:17] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:23:17] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2024-05-23 19:23:17] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:23:18] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:23:18] [INFO ] Deduced a trap composed of 227 places in 109 ms of which 2 ms to minimize.
[2024-05-23 19:23:18] [INFO ] Deduced a trap composed of 197 places in 94 ms of which 2 ms to minimize.
[2024-05-23 19:23:18] [INFO ] Deduced a trap composed of 192 places in 95 ms of which 2 ms to minimize.
[2024-05-23 19:23:18] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2024-05-23 19:23:18] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-23 19:23:18] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:23:18] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-23 19:23:18] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-05-23 19:23:19] [INFO ] Deduced a trap composed of 191 places in 86 ms of which 1 ms to minimize.
[2024-05-23 19:23:19] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:23:19] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:23:24] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-05-23 19:23:24] [INFO ] Deduced a trap composed of 136 places in 85 ms of which 1 ms to minimize.
[2024-05-23 19:23:24] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-05-23 19:23:24] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-23 19:23:24] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:23:24] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:23:24] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:23:25] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:23:25] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-05-23 19:23:25] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:23:25] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 1 ms to minimize.
[2024-05-23 19:23:25] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:23:26] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:23:26] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 3 ms to minimize.
[2024-05-23 19:23:26] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:23:27] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-23 19:23:27] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:23:29] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:23:31] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:23:32] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:23:32] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:23:33] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:23:33] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:23:33] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:23:38] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-23 19:23:38] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:23:39] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2024-05-23 19:23:39] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:23:39] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:23:40] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
(s346 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/830 variables, and 68 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/362 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:23:44] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:23:44] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:23:44] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:23:45] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-23 19:23:45] [INFO ] Deduced a trap composed of 114 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:23:51] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 7 (OVERLAPS) 468/830 variables, 362/436 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/830 variables, 467/903 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-23 19:23:58] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-23 19:23:58] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 830/830 variables, and 905 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 58/58 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 362/410 places, 468/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60410 ms. Remains : 362/410 places, 468/541 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Product exploration explored 100000 steps with 50000 reset in 139 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 : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 11 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-17-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLCardinality-13 finished in 60832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(p1)))'
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 541/541 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 397 transition count 525
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 397 transition count 525
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 387 transition count 511
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 387 transition count 511
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 387 transition count 509
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 380 transition count 497
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 380 transition count 497
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 374 transition count 490
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 374 transition count 490
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 370 transition count 485
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 370 transition count 485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 370 transition count 483
Applied a total of 84 rules in 26 ms. Remains 370 /410 variables (removed 40) and now considering 483/541 (removed 58) transitions.
// Phase 1: matrix 483 rows 370 cols
[2024-05-23 19:24:12] [INFO ] Computed 18 invariants in 7 ms
[2024-05-23 19:24:12] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-23 19:24:12] [INFO ] Invariant cache hit.
[2024-05-23 19:24:12] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-23 19:24:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:24:18] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
[2024-05-23 19:24:18] [INFO ] Deduced a trap composed of 138 places in 105 ms of which 2 ms to minimize.
[2024-05-23 19:24:18] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-23 19:24:18] [INFO ] Deduced a trap composed of 127 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:24:18] [INFO ] Deduced a trap composed of 115 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:24:18] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:24:19] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-23 19:24:19] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:24:19] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-23 19:24:19] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-23 19:24:19] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:24:19] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-23 19:24:20] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 5 ms to minimize.
[2024-05-23 19:24:20] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2024-05-23 19:24:20] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 1 ms to minimize.
[2024-05-23 19:24:21] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2024-05-23 19:24:21] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-23 19:24:21] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:24:22] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 1 ms to minimize.
[2024-05-23 19:24:22] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:24:25] [INFO ] Deduced a trap composed of 197 places in 94 ms of which 2 ms to minimize.
[2024-05-23 19:24:27] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:24:27] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:24:27] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:24:27] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
[2024-05-23 19:24:28] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:24:28] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-23 19:24:29] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:24:29] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:24:29] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:24:29] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:24:29] [INFO ] Deduced a trap composed of 137 places in 99 ms of which 2 ms to minimize.
[2024-05-23 19:24:30] [INFO ] Deduced a trap composed of 137 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:24:30] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:24:30] [INFO ] Deduced a trap composed of 137 places in 85 ms of which 2 ms to minimize.
[2024-05-23 19:24:30] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:24:30] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:24:30] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 2 ms to minimize.
[2024-05-23 19:24:30] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:24:30] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-05-23 19:24:30] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-23 19:24:31] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-23 19:24:31] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:24:31] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-05-23 19:24:31] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:24:32] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-23 19:24:32] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-05-23 19:24:33] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-05-23 19:24:33] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:24:33] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:24:33] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:24:36] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:24:36] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:24:36] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:24:36] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:24:37] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:24:37] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 482 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 370/853 variables, and 75 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/370 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (OVERLAPS) 1/370 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:24:47] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-23 19:24:48] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-23 19:24:48] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2024-05-23 19:24:49] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:24:50] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:24:51] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 2 ms to minimize.
[2024-05-23 19:24:51] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:24:52] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:24:52] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (OVERLAPS) 483/853 variables, 370/454 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 482/936 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 853/853 variables, and 936 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 370/370 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 66/66 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 370/410 places, 483/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60410 ms. Remains : 370/410 places, 483/541 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 121 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 p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-17-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLCardinality-14 finished in 60789 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&&X(p1))))||(p0&&F(p2)))))'
Support contains 5 out of 410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 541/541 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 396 transition count 525
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 396 transition count 525
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 40 place count 384 transition count 508
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 384 transition count 508
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 384 transition count 506
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 377 transition count 495
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 377 transition count 495
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 371 transition count 489
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 371 transition count 489
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 369 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 369 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 369 transition count 484
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 368 transition count 483
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 368 transition count 483
Applied a total of 87 rules in 30 ms. Remains 368 /410 variables (removed 42) and now considering 483/541 (removed 58) transitions.
// Phase 1: matrix 483 rows 368 cols
[2024-05-23 19:25:13] [INFO ] Computed 18 invariants in 5 ms
[2024-05-23 19:25:13] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-23 19:25:13] [INFO ] Invariant cache hit.
[2024-05-23 19:25:13] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-23 19:25:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (OVERLAPS) 1/368 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:25:18] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 3 ms to minimize.
[2024-05-23 19:25:18] [INFO ] Deduced a trap composed of 137 places in 96 ms of which 2 ms to minimize.
[2024-05-23 19:25:19] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 2 ms to minimize.
[2024-05-23 19:25:19] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-23 19:25:19] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:25:19] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-23 19:25:20] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:25:20] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-23 19:25:20] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:25:20] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:25:20] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:25:20] [INFO ] Deduced a trap composed of 134 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:25:20] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-23 19:25:20] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:25:20] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:25:21] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:25:21] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:25:21] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:25:21] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:25:21] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:25:24] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-23 19:25:24] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2024-05-23 19:25:24] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:25:25] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2024-05-23 19:25:25] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-23 19:25:25] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-23 19:25:26] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-23 19:25:26] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-23 19:25:26] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-23 19:25:26] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-23 19:25:26] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:25:27] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 2 ms to minimize.
[2024-05-23 19:25:27] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-23 19:25:27] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-05-23 19:25:27] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-23 19:25:27] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
[2024-05-23 19:25:27] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:25:28] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-05-23 19:25:28] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-23 19:25:28] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:25:28] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-23 19:25:28] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:25:29] [INFO ] Deduced a trap composed of 139 places in 100 ms of which 2 ms to minimize.
[2024-05-23 19:25:29] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-23 19:25:29] [INFO ] Deduced a trap composed of 181 places in 95 ms of which 2 ms to minimize.
[2024-05-23 19:25:29] [INFO ] Deduced a trap composed of 195 places in 92 ms of which 2 ms to minimize.
[2024-05-23 19:25:29] [INFO ] Deduced a trap composed of 140 places in 91 ms of which 2 ms to minimize.
[2024-05-23 19:25:29] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:25:30] [INFO ] Deduced a trap composed of 140 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:25:31] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-05-23 19:25:32] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-05-23 19:25:32] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:25:32] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
[2024-05-23 19:25:32] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:25:34] [INFO ] Deduced a trap composed of 140 places in 87 ms of which 2 ms to minimize.
[2024-05-23 19:25:34] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-23 19:25:34] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:25:35] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-05-23 19:25:36] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:25:42] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-23 19:25:42] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:25:42] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:25:43] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:25:43] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/851 variables, and 82 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/368 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (OVERLAPS) 1/368 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-23 19:25:46] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-23 19:25:46] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-05-23 19:25:46] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2024-05-23 19:25:46] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
[2024-05-23 19:25:47] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-23 19:25:48] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:25:49] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/851 variables, 368/457 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/851 variables, 482/939 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/851 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/851 variables, and 939 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 368/368 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 71/71 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 368/410 places, 483/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60423 ms. Remains : 368/410 places, 483/541 transitions.
Stuttering acceptance computed with spot in 365 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-17-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 117 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 p0 p2 p1), (X p2), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-17-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-17-LTLCardinality-15 finished in 61064 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)||X(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' '!(F(G(p0)))'
[2024-05-23 19:26:14] [INFO ] Flatten gal took : 21 ms
[2024-05-23 19:26:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 19:26:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 410 places, 541 transitions and 1287 arcs took 6 ms.
Total runtime 633107 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-17

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 3175
MODEL NAME: /home/mcc/execution/412/model
410 places, 541 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA HealthRecord-PT-17-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-17-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716492656112

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-17"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-17, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640602400827"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;