Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 20:29 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 72K 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-14-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716520848142

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 03:20:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:20:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:20:49] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-24 03:20:49] [INFO ] Transformed 162 places.
[2024-05-24 03:20:49] [INFO ] Transformed 347 transitions.
[2024-05-24 03:20:49] [INFO ] Found NUPN structural information;
[2024-05-24 03:20:49] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
FORMULA HealthRecord-PT-14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-14-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-14-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-14-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-14-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-14-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-14-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 318/318 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 79 transition count 158
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 79 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 172 place count 73 transition count 146
Iterating global reduction 0 with 6 rules applied. Total rules applied 178 place count 73 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 183 place count 73 transition count 141
Applied a total of 183 rules in 31 ms. Remains 73 /162 variables (removed 89) and now considering 141/318 (removed 177) transitions.
[2024-05-24 03:20:49] [INFO ] Flow matrix only has 135 transitions (discarded 6 similar events)
// Phase 1: matrix 135 rows 73 cols
[2024-05-24 03:20:49] [INFO ] Computed 12 invariants in 15 ms
[2024-05-24 03:20:49] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-24 03:20:49] [INFO ] Flow matrix only has 135 transitions (discarded 6 similar events)
[2024-05-24 03:20:49] [INFO ] Invariant cache hit.
[2024-05-24 03:20:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:20:50] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-24 03:20:50] [INFO ] Flow matrix only has 135 transitions (discarded 6 similar events)
[2024-05-24 03:20:50] [INFO ] Invariant cache hit.
[2024-05-24 03:20:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-24 03:20:50] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 11 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:20:51] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 134/207 variables, 73/88 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 3 ms to minimize.
[2024-05-24 03:20:52] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-24 03:20:53] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 92 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4808 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 134/207 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 140/231 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 232 constraints, problems are : Problem set: 0 solved, 140 unsolved in 4581 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 6/6 constraints]
After SMT, in 9521ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 9538ms
Starting structural reductions in LTL mode, iteration 1 : 73/162 places, 141/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9928 ms. Remains : 73/162 places, 141/318 transitions.
Support contains 26 out of 73 places after structural reductions.
[2024-05-24 03:20:59] [INFO ] Flatten gal took : 35 ms
[2024-05-24 03:20:59] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:20:59] [INFO ] Input system was already deterministic with 141 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (3372 resets) in 1262 ms. (31 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (399 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (392 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (379 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (390 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (381 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (385 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (387 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
[2024-05-24 03:21:00] [INFO ] Flow matrix only has 135 transitions (discarded 6 similar events)
[2024-05-24 03:21:00] [INFO ] Invariant cache hit.
[2024-05-24 03:21:00] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 27/73 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 5 (OVERLAPS) 134/207 variables, 73/85 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/208 variables, 1/86 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 86 constraints, problems are : Problem set: 1 solved, 6 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 32/45 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:21:01] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 28/73 variables, 8/18 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 134/207 variables, 73/91 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 5/96 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/96 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/208 variables, 1/97 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 97 constraints, problems are : Problem set: 2 solved, 5 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 577ms problems are : Problem set: 2 solved, 5 unsolved
Parikh walk visited 4 properties in 353 ms.
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 141/141 transitions.
Graph (trivial) has 77 edges and 73 vertex of which 4 / 73 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 313 edges and 71 vertex of which 67 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 67 transition count 129
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 66 transition count 126
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 64 transition count 125
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 22 place count 52 transition count 101
Iterating global reduction 3 with 12 rules applied. Total rules applied 34 place count 52 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 52 transition count 100
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 39 place count 48 transition count 90
Iterating global reduction 4 with 4 rules applied. Total rules applied 43 place count 48 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 46 place count 48 transition count 87
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 49 place count 45 transition count 80
Iterating global reduction 5 with 3 rules applied. Total rules applied 52 place count 45 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 58 place count 45 transition count 74
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 59 place count 44 transition count 72
Iterating global reduction 6 with 1 rules applied. Total rules applied 60 place count 44 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 63 place count 44 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 65 place count 43 transition count 68
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 75 place count 38 transition count 99
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 76 place count 38 transition count 98
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 82 place count 38 transition count 92
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 88 place count 32 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 90 place count 32 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 91 place count 32 transition count 163
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 93 place count 31 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 96 place count 31 transition count 159
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 97 place count 30 transition count 120
Iterating global reduction 9 with 1 rules applied. Total rules applied 98 place count 30 transition count 120
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 99 place count 29 transition count 118
Iterating global reduction 9 with 1 rules applied. Total rules applied 100 place count 29 transition count 118
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 110 place count 29 transition count 108
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 119 place count 29 transition count 108
Applied a total of 119 rules in 77 ms. Remains 29 /73 variables (removed 44) and now considering 108/141 (removed 33) transitions.
Running 92 sub problems to find dead transitions.
[2024-05-24 03:21:01] [INFO ] Flow matrix only has 78 transitions (discarded 30 similar events)
// Phase 1: matrix 78 rows 29 cols
[2024-05-24 03:21:01] [INFO ] Computed 8 invariants in 6 ms
[2024-05-24 03:21:01] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 3 (OVERLAPS) 78/107 variables, 29/37 constraints. Problems are: Problem set: 2 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 17/54 constraints. Problems are: Problem set: 2 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/107 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 54 constraints, problems are : Problem set: 2 solved, 90 unsolved in 1038 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 29/29 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 2/29 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 78/107 variables, 29/37 constraints. Problems are: Problem set: 2 solved, 90 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 17/54 constraints. Problems are: Problem set: 5 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 87/141 constraints. Problems are: Problem set: 5 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/141 constraints. Problems are: Problem set: 5 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/141 constraints. Problems are: Problem set: 5 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 141 constraints, problems are : Problem set: 5 solved, 87 unsolved in 1765 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 29/29 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 87/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 2900ms problems are : Problem set: 5 solved, 87 unsolved
Search for dead transitions found 5 dead transitions in 2905ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 29/73 places, 103/141 transitions.
Graph (complete) has 117 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 103
Applied a total of 2 rules in 8 ms. Remains 28 /29 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2990 ms. Remains : 28/73 places, 103/141 transitions.
RANDOM walk for 40000 steps (4266 resets) in 805 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (822 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 472 steps, run visited all 1 properties in 9 ms. (steps per millisecond=52 )
Probabilistic random walk after 472 steps, saw 213 distinct states, run finished after 13 ms. (steps per millisecond=36 ) properties seen :1
FORMULA HealthRecord-PT-14-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA HealthRecord-PT-14-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 7 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 141/141 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 57 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 57 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 57 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 53 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 53 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 53 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 50 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 50 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 50 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 49 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 49 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 61 place count 49 transition count 80
Applied a total of 61 rules in 7 ms. Remains 49 /73 variables (removed 24) and now considering 80/141 (removed 61) transitions.
[2024-05-24 03:21:04] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 49 cols
[2024-05-24 03:21:04] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:21:05] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:21:05] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 03:21:05] [INFO ] Invariant cache hit.
[2024-05-24 03:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:05] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-24 03:21:05] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 03:21:05] [INFO ] Invariant cache hit.
[2024-05-24 03:21:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:21:05] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:21:05] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 76/125 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:21:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 62 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:21:06] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/125 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 79/141 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 142 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1839 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints]
After SMT, in 3542ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3543ms
Starting structural reductions in LTL mode, iteration 1 : 49/73 places, 80/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3638 ms. Remains : 49/73 places, 80/141 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-14-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 96 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 75 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 40 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (3404 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (400 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1575203 steps, run visited all 1 properties in 1393 ms. (steps per millisecond=1130 )
Probabilistic random walk after 1575203 steps, saw 187234 distinct states, run finished after 1393 ms. (steps per millisecond=1130 ) properties seen :1
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 105 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-14-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-14-LTLCardinality-00 finished in 5911 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||F(p1)))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 141/141 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 57 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 57 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 57 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 54 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 54 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 54 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 52 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 52 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 52 place count 52 transition count 90
Applied a total of 52 rules in 9 ms. Remains 52 /73 variables (removed 21) and now considering 90/141 (removed 51) transitions.
[2024-05-24 03:21:10] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 52 cols
[2024-05-24 03:21:10] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:21:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:21:10] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:21:10] [INFO ] Invariant cache hit.
[2024-05-24 03:21:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-24 03:21:10] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:21:10] [INFO ] Invariant cache hit.
[2024-05-24 03:21:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:21:11] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:21:11] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:21:11] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/138 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/139 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 65 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:21:13] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/138 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 89/154 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 155 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2290 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 4/4 constraints]
After SMT, in 4116ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4118ms
Starting structural reductions in LTL mode, iteration 1 : 52/73 places, 90/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4219 ms. Remains : 52/73 places, 90/141 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-14-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 1 reset in 60 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (3373 resets) in 101 ms. (392 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (399 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (391 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
[2024-05-24 03:21:15] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:21:15] [INFO ] Invariant cache hit.
[2024-05-24 03:21:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/52 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/138 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/139 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/139 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 62 constraints, problems are : Problem set: 0 solved, 2 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 03:21:15] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:21:15] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 20/52 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 86/138 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 66 constraints, problems are : Problem set: 0 solved, 2 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 220ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 90/90 transitions.
Graph (trivial) has 45 edges and 52 vertex of which 6 / 52 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 190 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 48 transition count 77
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 45 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 40 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 40 transition count 111
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 40 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 36 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 36 transition count 105
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 36 transition count 230
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 33 place count 35 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 36 place count 35 transition count 226
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 34 transition count 182
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 34 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 33 transition count 180
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 33 transition count 180
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 55 place count 33 transition count 165
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 66 place count 33 transition count 165
Applied a total of 66 rules in 43 ms. Remains 33 /52 variables (removed 19) and now considering 165/90 (removed -75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 33/52 places, 165/90 transitions.
RANDOM walk for 38221 steps (2975 resets) in 107 ms. (353 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 90/90 transitions.
Graph (trivial) has 45 edges and 52 vertex of which 6 / 52 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 47 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
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 8 place count 45 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 45 transition count 101
Applied a total of 9 rules in 15 ms. Remains 45 /52 variables (removed 7) and now considering 101/90 (removed -11) transitions.
[2024-05-24 03:21:16] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
// Phase 1: matrix 93 rows 45 cols
[2024-05-24 03:21:16] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:21:16] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 03:21:16] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
[2024-05-24 03:21:16] [INFO ] Invariant cache hit.
[2024-05-24 03:21:16] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 03:21:16] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-24 03:21:16] [INFO ] Redundant transitions in 20 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-24 03:21:16] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
[2024-05-24 03:21:16] [INFO ] Invariant cache hit.
[2024-05-24 03:21:16] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 8/45 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 2 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 92/137 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 78 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 8/45 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 92/137 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 85/162 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 1/138 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 163 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2163 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 6/6 constraints]
After SMT, in 3900ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 3900ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/52 places, 101/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4024 ms. Remains : 45/52 places, 101/90 transitions.
Computed a total of 9 stabilizing places and 29 stable transitions
Computed a total of 9 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (3784 resets) in 355 ms. (112 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (400 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (402 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2024-05-24 03:21:20] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
[2024-05-24 03:21:20] [INFO ] Invariant cache hit.
[2024-05-24 03:21:20] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/45 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 92/137 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 72 constraints, problems are : Problem set: 0 solved, 2 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 03:21:20] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/45 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/137 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/138 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/138 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 75 constraints, problems are : Problem set: 0 solved, 2 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 186ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 537 steps, including 30 resets, run visited all 2 properties in 7 ms. (steps per millisecond=76 )
Parikh walk visited 2 properties in 11 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 43 ms.
Product exploration explored 100000 steps with 0 reset in 53 ms.
Built C files in :
/tmp/ltsmin17383093039113108061
[2024-05-24 03:21:21] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-24 03:21:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 03:21:21] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-24 03:21:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 03:21:21] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-24 03:21:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 03:21:21] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17383093039113108061
Running compilation step : cd /tmp/ltsmin17383093039113108061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 378 ms.
Running link step : cd /tmp/ltsmin17383093039113108061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17383093039113108061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16823910421486402355.hoa' '--buchi-type=spotba'
LTSmin run took 321 ms.
FORMULA HealthRecord-PT-14-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-14-LTLCardinality-01 finished in 11577 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((G(p1)||p0))))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 141/141 transitions.
Graph (trivial) has 79 edges and 73 vertex of which 6 / 73 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 54 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 54 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 54 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 50 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 50 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 50 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 47 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 47 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 55 place count 47 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 46 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 46 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 46 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 44 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 44 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 67 place count 43 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 43 transition count 78
Applied a total of 69 rules in 19 ms. Remains 43 /73 variables (removed 30) and now considering 78/141 (removed 63) transitions.
[2024-05-24 03:21:22] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
// Phase 1: matrix 73 rows 43 cols
[2024-05-24 03:21:22] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:21:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:21:22] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2024-05-24 03:21:22] [INFO ] Invariant cache hit.
[2024-05-24 03:21:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 03:21:22] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-24 03:21:22] [INFO ] Redundant transitions in 18 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-24 03:21:22] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2024-05-24 03:21:22] [INFO ] Invariant cache hit.
[2024-05-24 03:21:22] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 8/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 1/116 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/116 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 63 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 8/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-24 03:21:23] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 62/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 1/116 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 126 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1394 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 5/5 constraints]
After SMT, in 2489ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2492ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/73 places, 78/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2623 ms. Remains : 43/73 places, 78/141 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-14-LTLCardinality-03
Product exploration explored 100000 steps with 2 reset in 49 ms.
Product exploration explored 100000 steps with 1 reset in 48 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 119 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 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40000 steps (3727 resets) in 106 ms. (373 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (409 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-24 03:21:25] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2024-05-24 03:21:25] [INFO ] Invariant cache hit.
[2024-05-24 03:21:25] [INFO ] State equation strengthened by 7 read => feed constraints.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 2/116 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/43 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms 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 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 280 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-24 03:21:26] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2024-05-24 03:21:26] [INFO ] Invariant cache hit.
[2024-05-24 03:21:26] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:21:26] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2024-05-24 03:21:26] [INFO ] Invariant cache hit.
[2024-05-24 03:21:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 03:21:26] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-24 03:21:26] [INFO ] Redundant transitions in 36 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-24 03:21:26] [INFO ] Flow matrix only has 73 transitions (discarded 5 similar events)
[2024-05-24 03:21:26] [INFO ] Invariant cache hit.
[2024-05-24 03:21:26] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 8/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-24 03:21:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 6 ms to minimize.
[2024-05-24 03:21:26] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:21:26] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:21:26] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 1/116 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/116 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 63 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 8/43 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-24 03:21:27] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 62/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 1/116 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/116 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 126 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1420 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 5/5 constraints]
After SMT, in 2499ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2500ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2700 ms. Remains : 43/43 places, 78/78 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1406 steps (130 resets) in 8 ms. (156 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 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 45 ms.
Product exploration explored 100000 steps with 0 reset in 47 ms.
Built C files in :
/tmp/ltsmin2968451108467901248
[2024-05-24 03:21:29] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-24 03:21:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 03:21:29] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-24 03:21:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 03:21:29] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-24 03:21:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 03:21:29] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2968451108467901248
Running compilation step : cd /tmp/ltsmin2968451108467901248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 192 ms.
Running link step : cd /tmp/ltsmin2968451108467901248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2968451108467901248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3053810877091539577.hoa' '--buchi-type=spotba'
LTSmin run took 192 ms.
FORMULA HealthRecord-PT-14-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-14-LTLCardinality-03 finished in 7532 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 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 141/141 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 58 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 58 transition count 113
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 54 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 54 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 51 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 51 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 53 place count 51 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 50 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 50 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 50 transition count 82
Applied a total of 58 rules in 6 ms. Remains 50 /73 variables (removed 23) and now considering 82/141 (removed 59) transitions.
[2024-05-24 03:21:29] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
// Phase 1: matrix 78 rows 50 cols
[2024-05-24 03:21:29] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:21:30] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:21:30] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2024-05-24 03:21:30] [INFO ] Invariant cache hit.
[2024-05-24 03:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:30] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-24 03:21:30] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2024-05-24 03:21:30] [INFO ] Invariant cache hit.
[2024-05-24 03:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:21:30] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:21:30] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:21:30] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 77/127 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/128 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 64 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 77/127 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 81/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
After SMT, in 3387ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3389ms
Starting structural reductions in LTL mode, iteration 1 : 50/73 places, 82/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3487 ms. Remains : 50/73 places, 82/141 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-14-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 57 ms.
Product exploration explored 100000 steps with 3 reset in 71 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 92 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 56 ms :[true, (NOT p0)]
RANDOM walk for 757 steps (63 resets) in 5 ms. (126 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 102 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-14-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-14-LTLCardinality-10 finished in 3984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 141/141 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 57 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 57 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 57 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 54 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 54 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 54 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 52 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 52 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 52 transition count 93
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 51 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 51 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 51 transition count 88
Applied a total of 54 rules in 4 ms. Remains 51 /73 variables (removed 22) and now considering 88/141 (removed 53) transitions.
[2024-05-24 03:21:33] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 51 cols
[2024-05-24 03:21:33] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:21:33] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:21:33] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 03:21:33] [INFO ] Invariant cache hit.
[2024-05-24 03:21:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:34] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-24 03:21:34] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 03:21:34] [INFO ] Invariant cache hit.
[2024-05-24 03:21:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 03:21:34] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:21:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 84/135 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/136 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 63 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1407 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 03:21:35] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:21:35] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 84/135 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 87/151 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 152 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints]
After SMT, in 3679ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 3681ms
Starting structural reductions in LTL mode, iteration 1 : 51/73 places, 88/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3769 ms. Remains : 51/73 places, 88/141 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-14-LTLCardinality-11
Product exploration explored 100000 steps with 5 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 50 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3358 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (389 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2024567 steps, run visited all 1 properties in 1596 ms. (steps per millisecond=1268 )
Probabilistic random walk after 2024567 steps, saw 234088 distinct states, run finished after 1596 ms. (steps per millisecond=1268 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-24 03:21:40] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 03:21:40] [INFO ] Invariant cache hit.
[2024-05-24 03:21:40] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:21:40] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 03:21:40] [INFO ] Invariant cache hit.
[2024-05-24 03:21:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:40] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-05-24 03:21:40] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 03:21:40] [INFO ] Invariant cache hit.
[2024-05-24 03:21:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 03:21:40] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:21:41] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 84/135 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/136 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 63 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1444 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 03:21:42] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:21:42] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 84/135 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 87/151 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 152 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2188 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints]
After SMT, in 3655ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 3656ms
Finished structural reductions in LTL mode , in 1 iterations and 3760 ms. Remains : 51/51 places, 88/88 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3362 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (392 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2024567 steps, run visited all 1 properties in 1584 ms. (steps per millisecond=1278 )
Probabilistic random walk after 2024567 steps, saw 234088 distinct states, run finished after 1584 ms. (steps per millisecond=1278 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 48 ms.
Product exploration explored 100000 steps with 0 reset in 48 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 88/88 transitions.
Graph (trivial) has 45 edges and 51 vertex of which 6 / 51 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 47 transition count 82
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 47 transition count 128
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 47 transition count 127
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 10 rules in 19 ms. Remains 47 /51 variables (removed 4) and now considering 127/88 (removed -39) transitions.
[2024-05-24 03:21:47] [INFO ] Redundant transitions in 24 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-24 03:21:47] [INFO ] Flow matrix only has 112 transitions (discarded 15 similar events)
// Phase 1: matrix 112 rows 47 cols
[2024-05-24 03:21:47] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:21:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 03:21:47] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:21:47] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:21:47] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:21:47] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:21:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
[2024-05-24 03:21:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-05-24 03:21:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 5 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
[2024-05-24 03:21:47] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-24 03:21:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 9/18 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/18 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 111/158 variables, 47/65 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 19/84 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/84 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/159 variables, 1/85 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/85 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 0/85 constraints. Problems are: Problem set: 10 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 85 constraints, problems are : Problem set: 10 solved, 101 unsolved in 2392 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 10 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 6/47 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 9/18 constraints. Problems are: Problem set: 10 solved, 101 unsolved
[2024-05-24 03:21:50] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:21:50] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/20 constraints. Problems are: Problem set: 10 solved, 101 unsolved
[2024-05-24 03:21:50] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:21:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/22 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/22 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 111/158 variables, 47/69 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 19/88 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 101/189 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/189 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 1/159 variables, 1/190 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/190 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/159 variables, 0/190 constraints. Problems are: Problem set: 10 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 190 constraints, problems are : Problem set: 10 solved, 101 unsolved in 3795 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 101/111 constraints, Known Traps: 13/13 constraints]
After SMT, in 6247ms problems are : Problem set: 10 solved, 101 unsolved
Search for dead transitions found 10 dead transitions in 6248ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 47/51 places, 117/88 transitions.
Graph (complete) has 196 edges and 47 vertex of which 42 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 42 /47 variables (removed 5) and now considering 117/117 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/51 places, 117/88 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6307 ms. Remains : 42/51 places, 117/88 transitions.
Built C files in :
/tmp/ltsmin14753301579269936360
[2024-05-24 03:21:53] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14753301579269936360
Running compilation step : cd /tmp/ltsmin14753301579269936360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 189 ms.
Running link step : cd /tmp/ltsmin14753301579269936360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14753301579269936360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8266043985680977948.hoa' '--buchi-type=spotba'
LTSmin run took 3240 ms.
FORMULA HealthRecord-PT-14-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-14-LTLCardinality-11 finished in 23105 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(F(!p0))&&F(p0))||G(F(!p0)))))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 141/141 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 57 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 57 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 57 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 53 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 53 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 53 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 51 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 51 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 51 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 50 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 50 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 50 transition count 85
Applied a total of 56 rules in 5 ms. Remains 50 /73 variables (removed 23) and now considering 85/141 (removed 56) transitions.
[2024-05-24 03:21:57] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 50 cols
[2024-05-24 03:21:57] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:21:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:21:57] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:21:57] [INFO ] Invariant cache hit.
[2024-05-24 03:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:57] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-24 03:21:57] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:21:57] [INFO ] Invariant cache hit.
[2024-05-24 03:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:21:57] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 81/131 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 65 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1832 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:21:59] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 81/131 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 84/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 150 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2152 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints]
After SMT, in 4006ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 4007ms
Starting structural reductions in LTL mode, iteration 1 : 50/73 places, 85/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4101 ms. Remains : 50/73 places, 85/141 transitions.
Stuttering acceptance computed with spot in 136 ms :[p0, p0, p0]
Running random walk in product with property : HealthRecord-PT-14-LTLCardinality-14
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-14-LTLCardinality-14 finished in 4255 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 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 141/141 transitions.
Graph (trivial) has 80 edges and 73 vertex of which 6 / 73 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 55 transition count 111
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 55 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 55 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 51 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 51 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 51 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 48 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 48 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 55 place count 48 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 47 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 47 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 47 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 45 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 45 transition count 76
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 77 place count 39 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 80 place count 39 transition count 105
Applied a total of 80 rules in 28 ms. Remains 39 /73 variables (removed 34) and now considering 105/141 (removed 36) transitions.
[2024-05-24 03:22:01] [INFO ] Flow matrix only has 88 transitions (discarded 17 similar events)
// Phase 1: matrix 88 rows 39 cols
[2024-05-24 03:22:01] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:22:01] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-24 03:22:01] [INFO ] Flow matrix only has 88 transitions (discarded 17 similar events)
[2024-05-24 03:22:01] [INFO ] Invariant cache hit.
[2024-05-24 03:22:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 03:22:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-24 03:22:01] [INFO ] Redundant transitions in 20 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-24 03:22:01] [INFO ] Flow matrix only has 88 transitions (discarded 17 similar events)
[2024-05-24 03:22:01] [INFO ] Invariant cache hit.
[2024-05-24 03:22:01] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:22:01] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:22:01] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:22:02] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 87/126 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 67 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2586 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:22:04] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 87/126 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 89/156 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 157 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2724 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 4/4 constraints]
After SMT, in 5400ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 5401ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/73 places, 105/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5570 ms. Remains : 39/73 places, 105/141 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-14-LTLCardinality-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-14-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-14-LTLCardinality-15 finished in 5633 ms.
All properties solved by simple procedures.
Total runtime 77603 ms.

BK_STOP 1716520927006

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-14, 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 r180-tall-171640604200803"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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