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-171640604200779.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-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604200779
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717201383053

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-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:23:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:23:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:23:04] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-06-01 00:23:04] [INFO ] Transformed 159 places.
[2024-06-01 00:23:04] [INFO ] Transformed 334 transitions.
[2024-06-01 00:23:04] [INFO ] Found NUPN structural information;
[2024-06-01 00:23:04] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 162 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 5 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 76 transition count 148
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 76 transition count 148
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 171 place count 71 transition count 138
Iterating global reduction 0 with 5 rules applied. Total rules applied 176 place count 71 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 179 place count 71 transition count 135
Applied a total of 179 rules in 32 ms. Remains 71 /159 variables (removed 88) and now considering 135/307 (removed 172) transitions.
[2024-06-01 00:23:04] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
// Phase 1: matrix 130 rows 71 cols
[2024-06-01 00:23:04] [INFO ] Computed 11 invariants in 13 ms
[2024-06-01 00:23:04] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 00:23:04] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
[2024-06-01 00:23:04] [INFO ] Invariant cache hit.
[2024-06-01 00:23:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:23:04] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-06-01 00:23:04] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
[2024-06-01 00:23:04] [INFO ] Invariant cache hit.
[2024-06-01 00:23:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-06-01 00:23:05] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 13 ms to minimize.
[2024-06-01 00:23:05] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
[2024-06-01 00:23:05] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:23:05] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:23:05] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:23:05] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:23:06] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-06-01 00:23:06] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 129/200 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 91 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3850 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-06-01 00:23:09] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:23:09] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-06-01 00:23:09] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-06-01 00:23:10] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
[2024-06-01 00:23:10] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-06-01 00:23:10] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 129/200 variables, 71/96 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 134/230 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 1/201 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 14 (OVERLAPS) 0/201 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 231 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6768 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 14/14 constraints]
After SMT, in 10725ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 10739ms
Starting structural reductions in LTL mode, iteration 1 : 71/159 places, 135/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11095 ms. Remains : 71/159 places, 135/307 transitions.
Support contains 19 out of 71 places after structural reductions.
[2024-06-01 00:23:15] [INFO ] Flatten gal took : 70 ms
[2024-06-01 00:23:15] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:23:15] [INFO ] Input system was already deterministic with 135 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (2680 resets) in 1868 ms. (21 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40004 steps (385 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (392 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (393 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (390 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (382 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (382 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (383 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
[2024-06-01 00:23:16] [INFO ] Flow matrix only has 130 transitions (discarded 5 similar events)
[2024-06-01 00:23:16] [INFO ] Invariant cache hit.
[2024-06-01 00:23:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 33/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 27/71 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 00:23:17] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 129/200 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 84 constraints, problems are : Problem set: 0 solved, 7 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 33/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 00:23:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:23:17] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 00:23:17] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 00:23:17] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 27/71 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 00:23:17] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 129/200 variables, 71/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/201 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/201 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 96 constraints, problems are : Problem set: 0 solved, 7 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 800ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 2647 steps, including 113 resets, run visited all 3 properties in 13 ms. (steps per millisecond=203 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 142 ms.
Computed a total of 7 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' '!((F(p0)&&G(F((p1||G(p2))))))'
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Graph (trivial) has 67 edges and 71 vertex of which 8 / 71 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 58 transition count 116
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 58 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 58 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 54 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 54 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 54 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 53 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 53 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 53 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 51 transition count 117
Applied a total of 40 rules in 46 ms. Remains 51 /71 variables (removed 20) and now considering 117/135 (removed 18) transitions.
[2024-06-01 00:23:18] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
// Phase 1: matrix 106 rows 51 cols
[2024-06-01 00:23:18] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 00:23:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 00:23:18] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-06-01 00:23:18] [INFO ] Invariant cache hit.
[2024-06-01 00:23:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 00:23:18] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-06-01 00:23:18] [INFO ] Redundant transitions in 27 ms returned []
Running 103 sub problems to find dead transitions.
[2024-06-01 00:23:18] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-06-01 00:23:18] [INFO ] Invariant cache hit.
[2024-06-01 00:23:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 00:23:18] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 7/51 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 00:23:19] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:23:19] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 105/156 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/157 variables, and 83 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2226 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 7/51 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 00:23:20] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:23:21] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:23:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:23:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:23:21] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 00:23:21] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 00:23:21] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:23:21] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 105/156 variables, 51/71 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 103/194 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 0/156 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/157 variables, and 194 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3042 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 11/11 constraints]
After SMT, in 5341ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/71 places, 117/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5531 ms. Remains : 51/71 places, 117/135 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-00
Product exploration explored 100000 steps with 5 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 162 ms.
Computed a total of 13 stabilizing places and 28 stable transitions
Computed a total of 13 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 156 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (4105 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (570 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (565 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (576 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (578 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 53533 steps, run visited all 4 properties in 142 ms. (steps per millisecond=376 )
Probabilistic random walk after 53533 steps, saw 9053 distinct states, run finished after 145 ms. (steps per millisecond=369 ) properties seen :4
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 117/117 transitions.
Applied a total of 0 rules in 10 ms. Remains 51 /51 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-06-01 00:23:25] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-06-01 00:23:25] [INFO ] Invariant cache hit.
[2024-06-01 00:23:25] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 00:23:25] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-06-01 00:23:25] [INFO ] Invariant cache hit.
[2024-06-01 00:23:25] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 00:23:25] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-06-01 00:23:25] [INFO ] Redundant transitions in 22 ms returned []
Running 103 sub problems to find dead transitions.
[2024-06-01 00:23:25] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-06-01 00:23:25] [INFO ] Invariant cache hit.
[2024-06-01 00:23:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 00:23:26] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 7/51 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 00:23:26] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:23:26] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 105/156 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/157 variables, and 83 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 7/51 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 00:23:28] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
[2024-06-01 00:23:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:23:28] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:23:28] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:23:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 00:23:28] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 00:23:28] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:23:28] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 105/156 variables, 51/71 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 103/194 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 0/156 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/157 variables, and 194 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3090 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 11/11 constraints]
After SMT, in 5174ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5176ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5332 ms. Remains : 51/51 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 28 stable transitions
Computed a total of 13 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (4111 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (558 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (565 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (571 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (575 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 53533 steps, run visited all 4 properties in 143 ms. (steps per millisecond=374 )
Probabilistic random walk after 53533 steps, saw 9053 distinct states, run finished after 143 ms. (steps per millisecond=374 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 210 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4 reset in 66 ms.
Product exploration explored 100000 steps with 3 reset in 95 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 49 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 49 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 48 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 48 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 47 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 47 transition count 105
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 13 place count 47 transition count 100
Applied a total of 13 rules in 10 ms. Remains 47 /51 variables (removed 4) and now considering 100/117 (removed 17) transitions.
[2024-06-01 00:23:32] [INFO ] Flow matrix only has 90 transitions (discarded 10 similar events)
// Phase 1: matrix 90 rows 47 cols
[2024-06-01 00:23:32] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:23:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 00:23:32] [INFO ] Flow matrix only has 90 transitions (discarded 10 similar events)
[2024-06-01 00:23:32] [INFO ] Invariant cache hit.
[2024-06-01 00:23:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 00:23:32] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-01 00:23:32] [INFO ] Redundant transitions in 22 ms returned []
Running 86 sub problems to find dead transitions.
[2024-06-01 00:23:32] [INFO ] Flow matrix only has 90 transitions (discarded 10 similar events)
[2024-06-01 00:23:32] [INFO ] Invariant cache hit.
[2024-06-01 00:23:32] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:23:32] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 7/47 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:23:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:23:32] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 89/136 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/137 variables, and 75 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1445 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 7/47 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:23:33] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:23:33] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:23:34] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:23:34] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 89/136 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/136 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/137 variables, and 165 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1787 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints]
After SMT, in 3280ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3283ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/51 places, 100/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3415 ms. Remains : 47/51 places, 100/117 transitions.
Treatment of property HealthRecord-PT-11-LTLCardinality-00 finished in 17469 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(X((G((!p0||G(p1))) U G(p2)))))))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 61 transition count 116
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 61 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 61 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 57 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 57 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 57 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 55 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 55 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 53 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 53 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 53 transition count 86
Applied a total of 48 rules in 6 ms. Remains 53 /71 variables (removed 18) and now considering 86/135 (removed 49) transitions.
[2024-06-01 00:23:35] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
// Phase 1: matrix 82 rows 53 cols
[2024-06-01 00:23:35] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 00:23:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 00:23:35] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-06-01 00:23:35] [INFO ] Invariant cache hit.
[2024-06-01 00:23:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:23:35] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-01 00:23:35] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-06-01 00:23:35] [INFO ] Invariant cache hit.
[2024-06-01 00:23:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-01 00:23:35] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:23:36] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-01 00:23:36] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 81/134 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 67 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 81/134 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 85/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 152 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 3/3 constraints]
After SMT, in 3613ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 3614ms
Starting structural reductions in LTL mode, iteration 1 : 53/71 places, 86/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3710 ms. Remains : 53/71 places, 86/135 transitions.
Stuttering acceptance computed with spot in 412 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND p2 (NOT p1) p0), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-03 finished in 4146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 60 transition count 115
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 60 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 60 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 56 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 56 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 56 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 54 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 54 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 53 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 53 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 48 place count 53 transition count 87
Applied a total of 48 rules in 13 ms. Remains 53 /71 variables (removed 18) and now considering 87/135 (removed 48) transitions.
[2024-06-01 00:23:39] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 53 cols
[2024-06-01 00:23:39] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:23:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 00:23:39] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-06-01 00:23:39] [INFO ] Invariant cache hit.
[2024-06-01 00:23:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:23:39] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-06-01 00:23:39] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-06-01 00:23:39] [INFO ] Invariant cache hit.
[2024-06-01 00:23:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:23:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:23:40] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 83/136 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 1/137 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 65 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:23:41] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:23:41] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 83/136 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 86/152 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 1/137 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 153 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2239 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 4/4 constraints]
After SMT, in 3734ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3737ms
Starting structural reductions in LTL mode, iteration 1 : 53/71 places, 87/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3839 ms. Remains : 53/71 places, 87/135 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-06 finished in 3962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X((p1&&X(p2))))&&p0)))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 62 transition count 119
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 62 transition count 119
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 59 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 59 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 59 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 57 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 57 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 57 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 56 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 56 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 56 transition count 96
Applied a total of 39 rules in 8 ms. Remains 56 /71 variables (removed 15) and now considering 96/135 (removed 39) transitions.
[2024-06-01 00:23:43] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
// Phase 1: matrix 93 rows 56 cols
[2024-06-01 00:23:43] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 00:23:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 00:23:43] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2024-06-01 00:23:43] [INFO ] Invariant cache hit.
[2024-06-01 00:23:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:23:43] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-06-01 00:23:43] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2024-06-01 00:23:43] [INFO ] Invariant cache hit.
[2024-06-01 00:23:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:23:44] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 92/148 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 1/149 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 69 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:23:45] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 00:23:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 92/148 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 95/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/149 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/149 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 170 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3371 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints]
After SMT, in 5142ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 5143ms
Starting structural reductions in LTL mode, iteration 1 : 56/71 places, 96/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5260 ms. Remains : 56/71 places, 96/135 transitions.
Stuttering acceptance computed with spot in 485 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-11
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-11 finished in 5764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Graph (trivial) has 68 edges and 71 vertex of which 10 / 71 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 52 transition count 105
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 52 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 31 place count 52 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 47 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 47 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 47 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 44 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 44 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 44 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 42 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 42 transition count 72
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 63 place count 42 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 40 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 40 transition count 79
Applied a total of 68 rules in 63 ms. Remains 40 /71 variables (removed 31) and now considering 79/135 (removed 56) transitions.
[2024-06-01 00:23:49] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
// Phase 1: matrix 70 rows 40 cols
[2024-06-01 00:23:49] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 00:23:49] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 00:23:49] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-06-01 00:23:49] [INFO ] Invariant cache hit.
[2024-06-01 00:23:49] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 00:23:49] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-01 00:23:49] [INFO ] Redundant transitions in 20 ms returned []
Running 65 sub problems to find dead transitions.
[2024-06-01 00:23:49] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-06-01 00:23:49] [INFO ] Invariant cache hit.
[2024-06-01 00:23:49] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 00:23:49] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:23:49] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:23:49] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 69/109 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 65 constraints, problems are : Problem set: 0 solved, 65 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-01 00:23:50] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 69/109 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 65/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 131 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
After SMT, in 2089ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2093ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/71 places, 79/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2267 ms. Remains : 40/71 places, 79/135 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-12
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 2 ms.
FORMULA HealthRecord-PT-11-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLCardinality-12 finished in 2325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&F(p1)) U (G((G(!p0)||(!p0&&F(p1))))||(p2&&(G(!p0)||(!p0&&F(p1)))&&X(!p1))))))'
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 62 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 62 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 62 transition count 115
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 58 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 58 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 55 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 55 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 55 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 53 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 53 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 53 transition count 85
Applied a total of 48 rules in 7 ms. Remains 53 /71 variables (removed 18) and now considering 85/135 (removed 50) transitions.
[2024-06-01 00:23:51] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 53 cols
[2024-06-01 00:23:51] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 00:23:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 00:23:51] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 00:23:51] [INFO ] Invariant cache hit.
[2024-06-01 00:23:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:23:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-01 00:23:51] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 00:23:51] [INFO ] Invariant cache hit.
[2024-06-01 00:23:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-01 00:23:52] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:23:52] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-01 00:23:52] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 67 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1634 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 151 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
After SMT, in 3582ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3583ms
Starting structural reductions in LTL mode, iteration 1 : 53/71 places, 85/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3682 ms. Remains : 53/71 places, 85/135 transitions.
Stuttering acceptance computed with spot in 227 ms :[p0, p0, true, (AND (NOT p1) p0), (AND p0 p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLCardinality-14
Product exploration explored 100000 steps with 2 reset in 79 ms.
Product exploration explored 100000 steps with 1 reset in 112 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 130 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[p0, p0, true, (AND (NOT p1) p0), (AND p0 p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (2659 resets) in 190 ms. (209 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40002 steps (386 resets) in 29 ms. (1333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (394 resets) in 27 ms. (1428 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (395 resets) in 30 ms. (1290 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (382 resets) in 26 ms. (1481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (384 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
[2024-06-01 00:23:56] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 00:23:56] [INFO ] Invariant cache hit.
[2024-06-01 00:23:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf1 is UNSAT
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 00:23:56] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
Problem apf2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/53 variables, 8/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 80/133 variables, 53/64 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/65 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 65 constraints, problems are : Problem set: 3 solved, 2 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/53 variables, 8/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 80/133 variables, 53/64 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 2/66 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/67 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 67 constraints, problems are : Problem set: 3 solved, 2 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 190ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 861 steps, including 63 resets, run visited all 2 properties in 11 ms. (steps per millisecond=78 )
Parikh walk visited 2 properties in 10 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (OR (NOT p0) (NOT p1))), (G (OR p0 p1)), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p2))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 21 factoid took 467 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), false, (NOT p1)]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-06-01 00:23:57] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 00:23:57] [INFO ] Invariant cache hit.
[2024-06-01 00:23:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 00:23:57] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 00:23:57] [INFO ] Invariant cache hit.
[2024-06-01 00:23:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:23:57] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-01 00:23:57] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 00:23:57] [INFO ] Invariant cache hit.
[2024-06-01 00:23:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-01 00:23:57] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:23:57] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-01 00:23:58] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 67 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1722 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 151 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
After SMT, in 3705ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3708ms
Finished structural reductions in LTL mode , in 1 iterations and 3806 ms. Remains : 53/53 places, 85/85 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p2 p1), (X p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), false, (NOT p1)]
RANDOM walk for 40000 steps (2658 resets) in 139 ms. (285 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (395 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
[2024-06-01 00:24:01] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 00:24:01] [INFO ] Invariant cache hit.
[2024-06-01 00:24:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:24:01] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:24:01] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/25 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/53 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 80/133 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 66 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/25 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/53 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 80/133 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/134 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 180ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 53 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 p1), (X p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 9 factoid took 232 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), false, (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 149 ms.
Product exploration explored 100000 steps with 3 reset in 81 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), false, (NOT p1)]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 85/85 transitions.
Graph (trivial) has 46 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 47 transition count 77
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 47 transition count 125
Deduced a syphon composed of 6 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 47 transition count 124
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 13 ms. Remains 47 /53 variables (removed 6) and now considering 124/85 (removed -39) transitions.
[2024-06-01 00:24:02] [INFO ] Redundant transitions in 25 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 00:24:02] [INFO ] Flow matrix only has 107 transitions (discarded 17 similar events)
// Phase 1: matrix 107 rows 47 cols
[2024-06-01 00:24:02] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 00:24:02] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 10/20 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/20 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 106/153 variables, 47/67 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 21/88 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/88 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/154 variables, 1/89 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/89 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/89 constraints. Problems are: Problem set: 12 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 89 constraints, problems are : Problem set: 12 solved, 96 unsolved in 2060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 12 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 2/42 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/5 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 10/15 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 5/47 variables, 5/20 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/20 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 106/153 variables, 47/67 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 21/88 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 96/184 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/184 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 1/154 variables, 1/185 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/185 constraints. Problems are: Problem set: 12 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/154 variables, 0/185 constraints. Problems are: Problem set: 12 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 185 constraints, problems are : Problem set: 12 solved, 96 unsolved in 2965 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 96/108 constraints, Known Traps: 10/10 constraints]
After SMT, in 5078ms problems are : Problem set: 12 solved, 96 unsolved
Search for dead transitions found 12 dead transitions in 5079ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 47/53 places, 112/85 transitions.
Graph (complete) has 199 edges and 47 vertex of which 41 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 41 /47 variables (removed 6) and now considering 112/112 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/53 places, 112/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5136 ms. Remains : 41/53 places, 112/85 transitions.
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-06-01 00:24:08] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 53 cols
[2024-06-01 00:24:08] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 00:24:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 00:24:08] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 00:24:08] [INFO ] Invariant cache hit.
[2024-06-01 00:24:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:24:08] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-01 00:24:08] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2024-06-01 00:24:08] [INFO ] Invariant cache hit.
[2024-06-01 00:24:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-01 00:24:08] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:24:08] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-01 00:24:08] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 67 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1682 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 80/133 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 151 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1939 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
After SMT, in 3649ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3651ms
Finished structural reductions in LTL mode , in 1 iterations and 3755 ms. Remains : 53/53 places, 85/85 transitions.
Treatment of property HealthRecord-PT-11-LTLCardinality-14 finished in 20077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F((p1||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&F(p1)) U (G((G(!p0)||(!p0&&F(p1))))||(p2&&(G(!p0)||(!p0&&F(p1)))&&X(!p1))))))'
[2024-06-01 00:24:12] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:24:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 00:24:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 135 transitions and 447 arcs took 4 ms.
Total runtime 67893 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HealthRecord-PT-11-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA HealthRecord-PT-11-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717201462734

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name HealthRecord-PT-11-LTLCardinality-00
ltl formula formula --ltl=/tmp/1402/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 71 places, 135 transitions and 447 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1402/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1402/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1402/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1402/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 72 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 72, there are 233 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~106!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2660
pnml2lts-mc( 0/ 4): unique states count: 4473
pnml2lts-mc( 0/ 4): unique transitions count: 21067
pnml2lts-mc( 0/ 4): - self-loop count: 3115
pnml2lts-mc( 0/ 4): - claim dead count: 10383
pnml2lts-mc( 0/ 4): - claim found count: 2018
pnml2lts-mc( 0/ 4): - claim success count: 4500
pnml2lts-mc( 0/ 4): - cum. max stack depth: 322
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4500 states 21243 transitions, fanout: 4.721
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 150000, Transitions per second: 708100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 10.3 B/state, compr.: 3.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 135 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name HealthRecord-PT-11-LTLCardinality-14
ltl formula formula --ltl=/tmp/1402/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 71 places, 135 transitions and 447 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1402/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1402/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1402/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1402/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 73 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 72, there are 159 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~133 levels ~10000 states ~50244 transitions
pnml2lts-mc( 3/ 4): ~133 levels ~20000 states ~107448 transitions
pnml2lts-mc( 3/ 4): ~214 levels ~40000 states ~246172 transitions
pnml2lts-mc( 3/ 4): ~305 levels ~80000 states ~518984 transitions
pnml2lts-mc( 3/ 4): ~485 levels ~160000 states ~1147952 transitions
pnml2lts-mc( 1/ 4): ~584 levels ~320000 states ~2315172 transitions
pnml2lts-mc( 1/ 4): ~2164 levels ~640000 states ~5309464 transitions
pnml2lts-mc( 1/ 4): ~2164 levels ~1280000 states ~10811272 transitions
pnml2lts-mc( 1/ 4): ~4850 levels ~2560000 states ~25397276 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 769322
pnml2lts-mc( 0/ 4): unique states count: 2506307
pnml2lts-mc( 0/ 4): unique transitions count: 28610758
pnml2lts-mc( 0/ 4): - self-loop count: 2014601
pnml2lts-mc( 0/ 4): - claim dead count: 17919455
pnml2lts-mc( 0/ 4): - claim found count: 6275370
pnml2lts-mc( 0/ 4): - claim success count: 2510333
pnml2lts-mc( 0/ 4): - cum. max stack depth: 22135
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2524389 states 28873486 transitions, fanout: 11.438
pnml2lts-mc( 0/ 4): Total exploration time 9.900 sec (9.900 sec minimum, 9.900 sec on average)
pnml2lts-mc( 0/ 4): States per second: 254989, Transitions per second: 2916514
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 19.2MB, 8.1 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 135 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 19.2MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-11"
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-11, 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-171640604200779"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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