Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 46K 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-01-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717200641222

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:10:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:10:42] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-06-01 00:10:42] [INFO ] Transformed 117 places.
[2024-06-01 00:10:42] [INFO ] Transformed 218 transitions.
[2024-06-01 00:10:42] [INFO ] Found NUPN structural information;
[2024-06-01 00:10:42] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 154 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 5 transitions
Reduce redundant transitions removed 5 transitions.
FORMULA HealthRecord-PT-01-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 213/213 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 71 transition count 128
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 71 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 64 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 64 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 63 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 63 transition count 111
Applied a total of 108 rules in 23 ms. Remains 63 /117 variables (removed 54) and now considering 111/213 (removed 102) transitions.
[2024-06-01 00:10:42] [INFO ] Flow matrix only has 110 transitions (discarded 1 similar events)
// Phase 1: matrix 110 rows 63 cols
[2024-06-01 00:10:42] [INFO ] Computed 7 invariants in 15 ms
[2024-06-01 00:10:42] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-01 00:10:42] [INFO ] Flow matrix only has 110 transitions (discarded 1 similar events)
[2024-06-01 00:10:42] [INFO ] Invariant cache hit.
[2024-06-01 00:10:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:10:43] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-06-01 00:10:43] [INFO ] Flow matrix only has 110 transitions (discarded 1 similar events)
[2024-06-01 00:10:43] [INFO ] Invariant cache hit.
[2024-06-01 00:10:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 00:10:43] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 12 ms to minimize.
[2024-06-01 00:10:43] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:10:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:10:43] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:10:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:10:43] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:10:43] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:10:43] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:10:43] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:10:44] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:10:44] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 00:10:44] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:10:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 00:10:44] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:10:44] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 109/172 variables, 63/85 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 00:10:45] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:10:45] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/173 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 0/173 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 88 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3901 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 00:10:47] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:10:47] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:10:47] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:10:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 00:10:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:10:47] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 00:10:48] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 109/172 variables, 63/94 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 110/204 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 1/173 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/173 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 205 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 9213ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 9227ms
Starting structural reductions in LTL mode, iteration 1 : 63/117 places, 111/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9620 ms. Remains : 63/117 places, 111/213 transitions.
Support contains 23 out of 63 places after structural reductions.
[2024-06-01 00:10:52] [INFO ] Flatten gal took : 26 ms
[2024-06-01 00:10:52] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:10:52] [INFO ] Input system was already deterministic with 111 transitions.
RANDOM walk for 40000 steps (2122 resets) in 1255 ms. (31 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40004 steps (340 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (316 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
[2024-06-01 00:10:53] [INFO ] Flow matrix only has 110 transitions (discarded 1 similar events)
[2024-06-01 00:10:53] [INFO ] Invariant cache hit.
[2024-06-01 00:10:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/63 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 109/172 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/173 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 71 constraints, problems are : Problem set: 0 solved, 2 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:10:53] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:10:53] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:10:53] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/63 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:10:53] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 109/172 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:10:53] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/173 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/173 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 78 constraints, problems are : Problem set: 0 solved, 2 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 3018 steps, including 175 resets, run visited all 2 properties in 15 ms. (steps per millisecond=201 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 19 ms.
Computed a total of 6 stabilizing places and 10 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' '!((p0 U G(!p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 111/111 transitions.
Graph (trivial) has 75 edges and 63 vertex of which 14 / 63 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 42 transition count 76
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 42 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 30 place count 42 transition count 73
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 38 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 38 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 38 transition count 62
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 37 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 37 transition count 59
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 2 with 2 rules applied. Total rules applied 45 place count 36 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 36 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 34 transition count 60
Applied a total of 49 rules in 32 ms. Remains 34 /63 variables (removed 29) and now considering 60/111 (removed 51) transitions.
[2024-06-01 00:10:53] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
// Phase 1: matrix 53 rows 34 cols
[2024-06-01 00:10:53] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 00:10:53] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 00:10:53] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2024-06-01 00:10:53] [INFO ] Invariant cache hit.
[2024-06-01 00:10:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 00:10:53] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-01 00:10:53] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-01 00:10:53] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2024-06-01 00:10:53] [INFO ] Invariant cache hit.
[2024-06-01 00:10:53] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 00:10:53] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 00:10:54] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 00:10:54] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 00:10:54] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 52/86 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/87 variables, and 51 constraints, problems are : Problem set: 0 solved, 46 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-01 00:10:54] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 00:10:54] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 8 ms to minimize.
[2024-06-01 00:10:54] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 52/86 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 46/100 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/87 variables, and 100 constraints, problems are : Problem set: 0 solved, 46 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 7/7 constraints]
After SMT, in 1330ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1331ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/63 places, 60/111 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1452 ms. Remains : 34/63 places, 60/111 transitions.
Stuttering acceptance computed with spot in 274 ms :[p0, true, p0]
Running random walk in product with property : HealthRecord-PT-01-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-01-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLCardinality-01 finished in 1779 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)) U (p1&&(p2 U p3))))))'
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 111/111 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 52 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 52 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 52 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 49 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 49 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 49 transition count 77
Applied a total of 33 rules in 5 ms. Remains 49 /63 variables (removed 14) and now considering 77/111 (removed 34) transitions.
[2024-06-01 00:10:55] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
// Phase 1: matrix 76 rows 49 cols
[2024-06-01 00:10:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 00:10:55] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 00:10:55] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
[2024-06-01 00:10:55] [INFO ] Invariant cache hit.
[2024-06-01 00:10:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:10:55] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-06-01 00:10:55] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
[2024-06-01 00:10:55] [INFO ] Invariant cache hit.
[2024-06-01 00:10:55] [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, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 00:10:55] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:10:55] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 75/124 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 59 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 00:10:56] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:10:56] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 2 ms to minimize.
[2024-06-01 00:10:57] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:10:57] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:10:57] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:10:57] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 00:10:57] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:10:57] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 00:10:57] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 75/124 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 76/143 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/125 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/125 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 144 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2522 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 11/11 constraints]
After SMT, in 3725ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3726ms
Starting structural reductions in LTL mode, iteration 1 : 49/63 places, 77/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3819 ms. Remains : 49/63 places, 77/111 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), p0, (NOT p3), true, (NOT p3)]
Running random walk in product with property : HealthRecord-PT-01-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-01-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLCardinality-07 finished in 4247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 111/111 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 49 transition count 82
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 49 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 49 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 45 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 45 transition count 71
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 45 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 44 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 44 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 43 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 43 transition count 63
Applied a total of 46 rules in 7 ms. Remains 43 /63 variables (removed 20) and now considering 63/111 (removed 48) transitions.
[2024-06-01 00:10:59] [INFO ] Flow matrix only has 62 transitions (discarded 1 similar events)
// Phase 1: matrix 62 rows 43 cols
[2024-06-01 00:10:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 00:10:59] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 00:10:59] [INFO ] Flow matrix only has 62 transitions (discarded 1 similar events)
[2024-06-01 00:10:59] [INFO ] Invariant cache hit.
[2024-06-01 00:10:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:10:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-06-01 00:10:59] [INFO ] Flow matrix only has 62 transitions (discarded 1 similar events)
[2024-06-01 00:10:59] [INFO ] Invariant cache hit.
[2024-06-01 00:10:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-01 00:11:00] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:11:00] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 61/104 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 1/105 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 53 constraints, problems are : Problem set: 0 solved, 62 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-01 00:11:00] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:11:00] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 61/104 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 62/116 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 1/105 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 117 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints]
After SMT, in 2178ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2179ms
Starting structural reductions in LTL mode, iteration 1 : 43/63 places, 63/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2278 ms. Remains : 43/63 places, 63/111 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-01-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 5 ms.
FORMULA HealthRecord-PT-01-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLCardinality-11 finished in 2392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(p0))||(X(p2)&&p1))))'
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 111/111 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 51 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 51 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 51 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 48 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 48 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 48 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 47 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 47 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 46 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 46 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 46 transition count 70
Applied a total of 39 rules in 5 ms. Remains 46 /63 variables (removed 17) and now considering 70/111 (removed 41) transitions.
[2024-06-01 00:11:02] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
// Phase 1: matrix 69 rows 46 cols
[2024-06-01 00:11:02] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:11:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 00:11:02] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
[2024-06-01 00:11:02] [INFO ] Invariant cache hit.
[2024-06-01 00:11:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:11:02] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-06-01 00:11:02] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
[2024-06-01 00:11:02] [INFO ] Invariant cache hit.
[2024-06-01 00:11:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 00:11:02] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:11:02] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 68/114 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 56 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 00:11:03] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:11:03] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 00:11:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 68/114 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 69/127 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 1/115 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 128 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1432 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 5/5 constraints]
After SMT, in 2543ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2544ms
Starting structural reductions in LTL mode, iteration 1 : 46/63 places, 70/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2625 ms. Remains : 46/63 places, 70/111 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-01-LTLCardinality-12
Product exploration explored 100000 steps with 1 reset in 202 ms.
Product exploration explored 100000 steps with 2 reset in 112 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 124 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 40000 steps (2099 resets) in 293 ms. (136 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40003 steps (315 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (326 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (321 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
[2024-06-01 00:11:05] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
[2024-06-01 00:11:05] [INFO ] Invariant cache hit.
[2024-06-01 00:11:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 68/114 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:11:05] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 55 constraints, problems are : Problem set: 0 solved, 3 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:11:06] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/46 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 68/114 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/115 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/115 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 59 constraints, problems are : Problem set: 0 solved, 3 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1597 steps, including 66 resets, run visited all 3 properties in 3 ms. (steps per millisecond=532 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (AND p0 (NOT p1))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 19 factoid took 384 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 189 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-01 00:11:06] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
[2024-06-01 00:11:06] [INFO ] Invariant cache hit.
[2024-06-01 00:11:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 00:11:06] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
[2024-06-01 00:11:06] [INFO ] Invariant cache hit.
[2024-06-01 00:11:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:11:07] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-06-01 00:11:07] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
[2024-06-01 00:11:07] [INFO ] Invariant cache hit.
[2024-06-01 00:11:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 00:11:07] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:11:07] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 68/114 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 56 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 00:11:08] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 00:11:08] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 00:11:08] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 68/114 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 69/127 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 1/115 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 128 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1476 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 5/5 constraints]
After SMT, in 2553ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2553ms
Finished structural reductions in LTL mode , in 1 iterations and 2631 ms. Remains : 46/46 places, 70/70 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 119 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 40000 steps (2107 resets) in 139 ms. (285 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40003 steps (305 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (329 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (308 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
[2024-06-01 00:11:10] [INFO ] Flow matrix only has 69 transitions (discarded 1 similar events)
[2024-06-01 00:11:10] [INFO ] Invariant cache hit.
[2024-06-01 00:11:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/46 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 68/114 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:11:10] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 55 constraints, problems are : Problem set: 0 solved, 3 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:11:10] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/46 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 68/114 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/115 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/115 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 59 constraints, problems are : Problem set: 0 solved, 3 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 261ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 17 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 12 factoid took 402 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 191 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 180 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-01-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLCardinality-12 finished in 9304 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(p0)||(((p0 U p1)||(!p2 U p3)) U p3)))))'
Support contains 7 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 111/111 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 51 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 51 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 51 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 48 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 48 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 48 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 47 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 47 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 46 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 46 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 46 transition count 71
Applied a total of 39 rules in 7 ms. Remains 46 /63 variables (removed 17) and now considering 71/111 (removed 40) transitions.
[2024-06-01 00:11:11] [INFO ] Flow matrix only has 70 transitions (discarded 1 similar events)
// Phase 1: matrix 70 rows 46 cols
[2024-06-01 00:11:11] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:11:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 00:11:11] [INFO ] Flow matrix only has 70 transitions (discarded 1 similar events)
[2024-06-01 00:11:11] [INFO ] Invariant cache hit.
[2024-06-01 00:11:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:11:11] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-01 00:11:11] [INFO ] Flow matrix only has 70 transitions (discarded 1 similar events)
[2024-06-01 00:11:11] [INFO ] Invariant cache hit.
[2024-06-01 00:11:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 00:11:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:11:11] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 00:11:11] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-01 00:11:11] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 00:11:11] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:11:11] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 69/115 variables, 46/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 00:11:12] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/116 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/116 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 61 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 00:11:13] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 69/115 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 70/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/116 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/116 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 132 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 8/8 constraints]
After SMT, in 3210ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3211ms
Starting structural reductions in LTL mode, iteration 1 : 46/63 places, 71/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3288 ms. Remains : 46/63 places, 71/111 transitions.
Stuttering acceptance computed with spot in 592 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), true, (NOT p3), (NOT p3), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-01-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Product exploration explored 100000 steps with 33333 reset in 152 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) p0 p2), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 11 states, 22 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-01-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-01-LTLCardinality-14 finished in 4241 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 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 111/111 transitions.
Graph (trivial) has 76 edges and 63 vertex of which 12 / 63 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 41 transition count 73
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 41 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 41 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 37 transition count 61
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 37 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 37 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 36 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 36 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 35 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 35 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 35 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 34 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 34 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 33 transition count 54
Applied a total of 55 rules in 17 ms. Remains 33 /63 variables (removed 30) and now considering 54/111 (removed 57) transitions.
[2024-06-01 00:11:15] [INFO ] Flow matrix only has 48 transitions (discarded 6 similar events)
// Phase 1: matrix 48 rows 33 cols
[2024-06-01 00:11:15] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 00:11:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 00:11:15] [INFO ] Flow matrix only has 48 transitions (discarded 6 similar events)
[2024-06-01 00:11:15] [INFO ] Invariant cache hit.
[2024-06-01 00:11:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 00:11:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-01 00:11:15] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-06-01 00:11:15] [INFO ] Flow matrix only has 48 transitions (discarded 6 similar events)
[2024-06-01 00:11:15] [INFO ] Invariant cache hit.
[2024-06-01 00:11:15] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 7/33 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 00:11:15] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 00:11:15] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 00:11:15] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 00:11:15] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 47/80 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/80 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/81 variables, and 49 constraints, problems are : Problem set: 0 solved, 40 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 7/33 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 00:11:16] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 47/80 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 40/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/80 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/81 variables, and 90 constraints, problems are : Problem set: 0 solved, 40 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 5/5 constraints]
After SMT, in 966ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 966ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/63 places, 54/111 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1052 ms. Remains : 33/63 places, 54/111 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-01-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-01-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-01-LTLCardinality-15 finished in 1100 ms.
All properties solved by simple procedures.
Total runtime 34412 ms.
ITS solved all properties within timeout

BK_STOP 1717200676779

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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