Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r199-smll-167840345800308.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is HealthRecord-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345800308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 18:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Feb 26 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 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-10-LTLFireability-00
FORMULA_NAME HealthRecord-PT-10-LTLFireability-01
FORMULA_NAME HealthRecord-PT-10-LTLFireability-02
FORMULA_NAME HealthRecord-PT-10-LTLFireability-03
FORMULA_NAME HealthRecord-PT-10-LTLFireability-04
FORMULA_NAME HealthRecord-PT-10-LTLFireability-05
FORMULA_NAME HealthRecord-PT-10-LTLFireability-06
FORMULA_NAME HealthRecord-PT-10-LTLFireability-07
FORMULA_NAME HealthRecord-PT-10-LTLFireability-08
FORMULA_NAME HealthRecord-PT-10-LTLFireability-09
FORMULA_NAME HealthRecord-PT-10-LTLFireability-10
FORMULA_NAME HealthRecord-PT-10-LTLFireability-11
FORMULA_NAME HealthRecord-PT-10-LTLFireability-12
FORMULA_NAME HealthRecord-PT-10-LTLFireability-13
FORMULA_NAME HealthRecord-PT-10-LTLFireability-14
FORMULA_NAME HealthRecord-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678516749127

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 06:39:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 06:39:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:39:11] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-11 06:39:11] [INFO ] Transformed 158 places.
[2023-03-11 06:39:11] [INFO ] Transformed 333 transitions.
[2023-03-11 06:39:11] [INFO ] Found NUPN structural information;
[2023-03-11 06:39:12] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 83 transition count 164
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 83 transition count 164
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 156 place count 77 transition count 152
Iterating global reduction 0 with 6 rules applied. Total rules applied 162 place count 77 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 165 place count 77 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 166 place count 76 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 167 place count 76 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 168 place count 75 transition count 144
Iterating global reduction 1 with 1 rules applied. Total rules applied 169 place count 75 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 172 place count 75 transition count 141
Applied a total of 172 rules in 44 ms. Remains 75 /158 variables (removed 83) and now considering 141/306 (removed 165) transitions.
[2023-03-11 06:39:12] [INFO ] Flow matrix only has 137 transitions (discarded 4 similar events)
// Phase 1: matrix 137 rows 75 cols
[2023-03-11 06:39:12] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-11 06:39:12] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-11 06:39:12] [INFO ] Flow matrix only has 137 transitions (discarded 4 similar events)
[2023-03-11 06:39:12] [INFO ] Invariant cache hit.
[2023-03-11 06:39:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:12] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-11 06:39:12] [INFO ] Flow matrix only has 137 transitions (discarded 4 similar events)
[2023-03-11 06:39:12] [INFO ] Invariant cache hit.
[2023-03-11 06:39:13] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/158 places, 141/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 75/158 places, 141/306 transitions.
Support contains 27 out of 75 places after structural reductions.
[2023-03-11 06:39:13] [INFO ] Flatten gal took : 63 ms
[2023-03-11 06:39:13] [INFO ] Flatten gal took : 23 ms
[2023-03-11 06:39:13] [INFO ] Input system was already deterministic with 141 transitions.
Incomplete random walk after 10000 steps, including 635 resets, run finished after 802 ms. (steps per millisecond=12 ) properties (out of 28) seen :17
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :2
Running SMT prover for 8 properties.
[2023-03-11 06:39:14] [INFO ] Flow matrix only has 137 transitions (discarded 4 similar events)
[2023-03-11 06:39:14] [INFO ] Invariant cache hit.
[2023-03-11 06:39:14] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 06:39:14] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 06:39:14] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:3
[2023-03-11 06:39:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:14] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :5 real:3
[2023-03-11 06:39:15] [INFO ] After 143ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:5
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-11 06:39:15] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:6
[2023-03-11 06:39:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 06:39:15] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 06:39:15] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 06:39:15] [INFO ] After 56ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-11 06:39:15] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-11 06:39:15] [INFO ] After 481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 18 ms.
Support contains 8 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 141/141 transitions.
Graph (trivial) has 77 edges and 75 vertex of which 10 / 75 are part of one of the 5 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 283 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 69 transition count 125
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 68 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 67 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 67 transition count 120
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 13 place count 64 transition count 120
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 27 place count 50 transition count 93
Iterating global reduction 3 with 14 rules applied. Total rules applied 41 place count 50 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 50 transition count 92
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 45 place count 47 transition count 86
Iterating global reduction 4 with 3 rules applied. Total rules applied 48 place count 47 transition count 86
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 53 place count 47 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 55 place count 46 transition count 80
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 65 place count 41 transition count 119
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 41 transition count 118
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 79 place count 41 transition count 118
Applied a total of 79 rules in 54 ms. Remains 41 /75 variables (removed 34) and now considering 118/141 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 41/75 places, 118/141 transitions.
Incomplete random walk after 10000 steps, including 629 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:39:16] [INFO ] Flow matrix only has 107 transitions (discarded 11 similar events)
// Phase 1: matrix 107 rows 41 cols
[2023-03-11 06:39:16] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-11 06:39:16] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 06:39:16] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 06:39:16] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 06:39:16] [INFO ] After 14ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:39:16] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:39:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 06:39:16] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 06:39:16] [INFO ] After 24ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 06:39:16] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 06:39:16] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 118/118 transitions.
Graph (complete) has 194 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 39 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 39 transition count 116
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 39 transition count 115
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 39 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 38 transition count 114
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 38 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 37 transition count 113
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 37 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 36 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 36 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 35 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 35 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 34 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 34 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 20 place count 34 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 33 transition count 109
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 33 transition count 107
Applied a total of 24 rules in 44 ms. Remains 33 /41 variables (removed 8) and now considering 107/118 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 33/41 places, 107/118 transitions.
Incomplete random walk after 10000 steps, including 900 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:39:16] [INFO ] Flow matrix only has 94 transitions (discarded 13 similar events)
// Phase 1: matrix 94 rows 33 cols
[2023-03-11 06:39:16] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-11 06:39:16] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-11 06:39:16] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 06:39:16] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 06:39:16] [INFO ] After 16ms SMT Verify possible using 29 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:39:16] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:39:16] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-11 06:39:16] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:39:16] [INFO ] After 12ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:39:16] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 06:39:16] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 107/107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 113
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 32 transition count 241
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 8 place count 31 transition count 237
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 16 place count 31 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 30 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 30 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 29 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 29 transition count 182
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 29 transition count 164
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 29 transition count 164
Applied a total of 39 rules in 42 ms. Remains 29 /33 variables (removed 4) and now considering 164/107 (removed -57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 29/33 places, 164/107 transitions.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 185 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 193 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2140 steps, run visited all 2 properties in 31 ms. (steps per millisecond=69 )
Probabilistic random walk after 2140 steps, saw 561 distinct states, run finished after 31 ms. (steps per millisecond=69 ) properties seen :2
Computed a total of 8 stabilizing places and 13 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 56 transition count 104
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 56 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 52 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 52 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 52 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 50 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 50 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 50 transition count 78
Applied a total of 62 rules in 9 ms. Remains 50 /75 variables (removed 25) and now considering 78/141 (removed 63) transitions.
[2023-03-11 06:39:17] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 50 cols
[2023-03-11 06:39:17] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 06:39:17] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 06:39:17] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:17] [INFO ] Invariant cache hit.
[2023-03-11 06:39:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:17] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-11 06:39:17] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:17] [INFO ] Invariant cache hit.
[2023-03-11 06:39:17] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 78/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 50/75 places, 78/141 transitions.
Stuttering acceptance computed with spot in 377 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA HealthRecord-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-01 finished in 695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Graph (trivial) has 88 edges and 75 vertex of which 10 / 75 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 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 50 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 50 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 50 transition count 97
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 45 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 45 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 45 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 43 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 43 transition count 75
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 43 transition count 69
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 3 with 4 rules applied. Total rules applied 70 place count 41 transition count 83
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 41 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 40 transition count 79
Applied a total of 74 rules in 42 ms. Remains 40 /75 variables (removed 35) and now considering 79/141 (removed 62) transitions.
[2023-03-11 06:39:18] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
// Phase 1: matrix 70 rows 40 cols
[2023-03-11 06:39:18] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-11 06:39:18] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2023-03-11 06:39:18] [INFO ] Invariant cache hit.
[2023-03-11 06:39:18] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 06:39:18] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-11 06:39:18] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-11 06:39:18] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2023-03-11 06:39:18] [INFO ] Invariant cache hit.
[2023-03-11 06:39:18] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/75 places, 79/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 40/75 places, 79/141 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s35 1), p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-02 finished in 540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||((p1 U X(p1))&&F((G(p3)&&p2))))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 58 transition count 108
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 58 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 54 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 54 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 54 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 53 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 53 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 53 transition count 88
Applied a total of 53 rules in 13 ms. Remains 53 /75 variables (removed 22) and now considering 88/141 (removed 53) transitions.
[2023-03-11 06:39:18] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2023-03-11 06:39:18] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 06:39:18] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 06:39:18] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 06:39:18] [INFO ] Invariant cache hit.
[2023-03-11 06:39:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:18] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-11 06:39:18] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 06:39:18] [INFO ] Invariant cache hit.
[2023-03-11 06:39:19] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/75 places, 88/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 53/75 places, 88/141 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p3), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(EQ s11 1), p2:(AND (EQ s35 1) (EQ s41 1)), p3:(AND (EQ s35 1) (EQ s41 1)), p0:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 623 ms.
Product exploration explored 100000 steps with 50000 reset in 422 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/53 stabilizing places and 5/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (NOT (AND p2 p3 (NOT p0)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0)))))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 12 factoid took 781 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 626 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:39:21] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 06:39:21] [INFO ] Invariant cache hit.
[2023-03-11 06:39:21] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 06:39:21] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:39:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 06:39:21] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:39:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:21] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:39:21] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2023-03-11 06:39:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-11 06:39:21] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-11 06:39:21] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 88/88 transitions.
Graph (trivial) has 49 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
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 181 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 73
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 46 transition count 71
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 44 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 44 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 14 place count 41 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 40 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 40 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 28 place count 34 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 34 transition count 105
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 34 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 33 place count 32 transition count 103
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 36 place count 32 transition count 100
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 48 place count 32 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 32 transition count 100
Applied a total of 49 rules in 35 ms. Remains 32 /53 variables (removed 21) and now considering 100/88 (removed -12) transitions.
[2023-03-11 06:39:21] [INFO ] Flow matrix only has 87 transitions (discarded 13 similar events)
// Phase 1: matrix 87 rows 32 cols
[2023-03-11 06:39:21] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 06:39:21] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 32/53 places, 100/88 transitions.
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 191 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 192 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished probabilistic random walk after 509 steps, run visited all 2 properties in 12 ms. (steps per millisecond=42 )
Probabilistic random walk after 509 steps, saw 230 distinct states, run finished after 13 ms. (steps per millisecond=39 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (NOT (AND p2 p3 (NOT p0)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0)))))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p3)), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3))))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p2 (NOT p0) p3))]
Knowledge based reduction with 12 factoid took 986 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
[2023-03-11 06:39:23] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2023-03-11 06:39:23] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 06:39:23] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 06:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:39:23] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-11 06:39:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:39:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 06:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:39:23] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-11 06:39:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 06:39:23] [INFO ] Computed and/alt/rep : 82/305/79 causal constraints (skipped 5 transitions) in 13 ms.
[2023-03-11 06:39:23] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-11 06:39:23] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 06:39:23] [INFO ] Invariant cache hit.
[2023-03-11 06:39:24] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 06:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:39:24] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-11 06:39:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:39:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 06:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:39:24] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-11 06:39:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 06:39:24] [INFO ] Computed and/alt/rep : 82/305/79 causal constraints (skipped 5 transitions) in 9 ms.
[2023-03-11 06:39:24] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 3 out of 53 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-11 06:39:24] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 06:39:24] [INFO ] Invariant cache hit.
[2023-03-11 06:39:24] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-11 06:39:24] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 06:39:24] [INFO ] Invariant cache hit.
[2023-03-11 06:39:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:24] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-11 06:39:24] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 06:39:24] [INFO ] Invariant cache hit.
[2023-03-11 06:39:24] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 53/53 places, 88/88 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/53 stabilizing places and 5/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3)), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3))))), (X (NOT (AND p2 (NOT p0) p3))), (X (X (NOT (AND p2 (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3)))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
Knowledge based reduction with 6 factoid took 308 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 631 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:39:25] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 06:39:25] [INFO ] Invariant cache hit.
[2023-03-11 06:39:25] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 06:39:25] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:39:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 06:39:25] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:39:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:25] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:39:25] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2023-03-11 06:39:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-11 06:39:25] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 06:39:25] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 88/88 transitions.
Graph (trivial) has 49 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 181 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 73
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 46 transition count 71
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 44 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 44 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 14 place count 41 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 40 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 40 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 28 place count 34 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 34 transition count 105
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 34 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 33 place count 32 transition count 103
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 36 place count 32 transition count 100
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 48 place count 32 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 32 transition count 100
Applied a total of 49 rules in 30 ms. Remains 32 /53 variables (removed 21) and now considering 100/88 (removed -12) transitions.
[2023-03-11 06:39:25] [INFO ] Flow matrix only has 87 transitions (discarded 13 similar events)
// Phase 1: matrix 87 rows 32 cols
[2023-03-11 06:39:25] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 06:39:25] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 32/53 places, 100/88 transitions.
Incomplete random walk after 10000 steps, including 1470 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 206 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 509 steps, run visited all 2 properties in 16 ms. (steps per millisecond=31 )
Probabilistic random walk after 509 steps, saw 230 distinct states, run finished after 16 ms. (steps per millisecond=31 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3)), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3))))), (X (NOT (AND p2 (NOT p0) p3))), (X (X (NOT (AND p2 (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3)))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (AND (NOT p0) p3)), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3))))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p2 (NOT p0) p3))]
Knowledge based reduction with 6 factoid took 389 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
[2023-03-11 06:39:26] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2023-03-11 06:39:26] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 06:39:26] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 06:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:39:26] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-11 06:39:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:39:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 06:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:39:26] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-11 06:39:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 06:39:26] [INFO ] Computed and/alt/rep : 82/305/79 causal constraints (skipped 5 transitions) in 8 ms.
[2023-03-11 06:39:26] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-11 06:39:26] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 06:39:26] [INFO ] Invariant cache hit.
[2023-03-11 06:39:26] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 06:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:39:26] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-11 06:39:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:39:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 06:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:39:26] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-11 06:39:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 06:39:26] [INFO ] Computed and/alt/rep : 82/305/79 causal constraints (skipped 5 transitions) in 14 ms.
[2023-03-11 06:39:26] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 496 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 88/88 transitions.
Graph (trivial) has 49 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 46 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 46 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 46 transition count 78
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 46 transition count 130
Deduced a syphon composed of 6 places in 1 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 46 transition count 129
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 13 rules in 31 ms. Remains 46 /53 variables (removed 7) and now considering 129/88 (removed -41) transitions.
[2023-03-11 06:39:28] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-11 06:39:28] [INFO ] Flow matrix only has 112 transitions (discarded 17 similar events)
// Phase 1: matrix 112 rows 46 cols
[2023-03-11 06:39:28] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 06:39:28] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/53 places, 129/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 46/53 places, 129/88 transitions.
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 88/88 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 86
Applied a total of 2 rules in 1 ms. Remains 52 /53 variables (removed 1) and now considering 86/88 (removed 2) transitions.
[2023-03-11 06:39:28] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 52 cols
[2023-03-11 06:39:28] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:28] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-11 06:39:28] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 06:39:28] [INFO ] Invariant cache hit.
[2023-03-11 06:39:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:28] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-11 06:39:28] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 06:39:28] [INFO ] Invariant cache hit.
[2023-03-11 06:39:28] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 86/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 52/53 places, 86/88 transitions.
Treatment of property HealthRecord-PT-10-LTLFireability-03 finished in 10030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Graph (trivial) has 88 edges and 75 vertex of which 10 / 75 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 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 51 transition count 100
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 51 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 51 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 48 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 48 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 48 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 47 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 47 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 47 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 46 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 44 transition count 104
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 44 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 43 transition count 100
Applied a total of 62 rules in 18 ms. Remains 43 /75 variables (removed 32) and now considering 100/141 (removed 41) transitions.
[2023-03-11 06:39:28] [INFO ] Flow matrix only has 89 transitions (discarded 11 similar events)
// Phase 1: matrix 89 rows 43 cols
[2023-03-11 06:39:28] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 06:39:28] [INFO ] Flow matrix only has 89 transitions (discarded 11 similar events)
[2023-03-11 06:39:28] [INFO ] Invariant cache hit.
[2023-03-11 06:39:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-11 06:39:28] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-11 06:39:28] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-11 06:39:28] [INFO ] Flow matrix only has 89 transitions (discarded 11 similar events)
[2023-03-11 06:39:28] [INFO ] Invariant cache hit.
[2023-03-11 06:39:29] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/75 places, 100/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 43/75 places, 100/141 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s33 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-04 finished in 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Graph (trivial) has 88 edges and 75 vertex of which 10 / 75 are part of one of the 5 SCC in 1 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 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 50 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 50 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 50 transition count 97
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 45 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 45 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 45 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 43 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 43 transition count 75
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 43 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 42 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 41 transition count 73
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 41 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 40 transition count 70
Applied a total of 73 rules in 20 ms. Remains 40 /75 variables (removed 35) and now considering 70/141 (removed 71) transitions.
[2023-03-11 06:39:29] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
// Phase 1: matrix 63 rows 40 cols
[2023-03-11 06:39:29] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 06:39:29] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
[2023-03-11 06:39:29] [INFO ] Invariant cache hit.
[2023-03-11 06:39:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 06:39:29] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-11 06:39:29] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 06:39:29] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
[2023-03-11 06:39:29] [INFO ] Invariant cache hit.
[2023-03-11 06:39:29] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/75 places, 70/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 40/75 places, 70/141 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-05 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(p1&&F(!p0))))))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 56 transition count 104
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 56 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 52 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 52 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 52 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 51 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 51 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 51 transition count 84
Applied a total of 57 rules in 6 ms. Remains 51 /75 variables (removed 24) and now considering 84/141 (removed 57) transitions.
[2023-03-11 06:39:29] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 51 cols
[2023-03-11 06:39:29] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-11 06:39:29] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2023-03-11 06:39:29] [INFO ] Invariant cache hit.
[2023-03-11 06:39:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:29] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-11 06:39:29] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2023-03-11 06:39:29] [INFO ] Invariant cache hit.
[2023-03-11 06:39:29] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/75 places, 84/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 51/75 places, 84/141 transitions.
Stuttering acceptance computed with spot in 139 ms :[p0, p0, p0]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s7 1), p0:(AND (EQ s3 1) (EQ s8 1) (EQ s12 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLFireability-06 finished in 849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Graph (trivial) has 90 edges and 75 vertex of which 10 / 75 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 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 51 transition count 100
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 51 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 51 transition count 99
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 46 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 46 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 46 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 44 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 44 transition count 77
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 44 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 43 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 41 transition count 80
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 41 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 40 transition count 76
Applied a total of 74 rules in 13 ms. Remains 40 /75 variables (removed 35) and now considering 76/141 (removed 65) transitions.
[2023-03-11 06:39:30] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
// Phase 1: matrix 67 rows 40 cols
[2023-03-11 06:39:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 06:39:30] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-11 06:39:30] [INFO ] Invariant cache hit.
[2023-03-11 06:39:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 06:39:30] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-11 06:39:30] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 06:39:30] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-11 06:39:30] [INFO ] Invariant cache hit.
[2023-03-11 06:39:30] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/75 places, 76/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 40/75 places, 76/141 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4 reset in 172 ms.
Product exploration explored 100000 steps with 2 reset in 285 ms.
Computed a total of 11 stabilizing places and 18 stable transitions
Computed a total of 11 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 949 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33036 steps, run visited all 1 properties in 69 ms. (steps per millisecond=478 )
Probabilistic random walk after 33036 steps, saw 5879 distinct states, run finished after 69 ms. (steps per millisecond=478 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-11 06:39:31] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-11 06:39:31] [INFO ] Invariant cache hit.
[2023-03-11 06:39:31] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 06:39:31] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-11 06:39:31] [INFO ] Invariant cache hit.
[2023-03-11 06:39:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 06:39:31] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-11 06:39:31] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 06:39:31] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-11 06:39:31] [INFO ] Invariant cache hit.
[2023-03-11 06:39:31] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 40/40 places, 76/76 transitions.
Computed a total of 11 stabilizing places and 18 stable transitions
Computed a total of 11 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 955 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33036 steps, run visited all 1 properties in 68 ms. (steps per millisecond=485 )
Probabilistic random walk after 33036 steps, saw 5879 distinct states, run finished after 68 ms. (steps per millisecond=485 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4 reset in 66 ms.
Product exploration explored 100000 steps with 0 reset in 113 ms.
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-11 06:39:32] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-11 06:39:32] [INFO ] Invariant cache hit.
[2023-03-11 06:39:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 06:39:32] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-11 06:39:32] [INFO ] Invariant cache hit.
[2023-03-11 06:39:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 06:39:32] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-11 06:39:32] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-11 06:39:32] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-11 06:39:32] [INFO ] Invariant cache hit.
[2023-03-11 06:39:33] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 40/40 places, 76/76 transitions.
Treatment of property HealthRecord-PT-10-LTLFireability-07 finished in 2756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p0||X(X(p1))))||F(!p2)))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 58 transition count 107
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 58 transition count 107
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 54 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 54 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 53 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 53 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 53 place count 53 transition count 87
Applied a total of 53 rules in 5 ms. Remains 53 /75 variables (removed 22) and now considering 87/141 (removed 54) transitions.
[2023-03-11 06:39:33] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
// Phase 1: matrix 83 rows 53 cols
[2023-03-11 06:39:33] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 06:39:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 06:39:33] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
[2023-03-11 06:39:33] [INFO ] Invariant cache hit.
[2023-03-11 06:39:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:33] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-11 06:39:33] [INFO ] Flow matrix only has 83 transitions (discarded 4 similar events)
[2023-03-11 06:39:33] [INFO ] Invariant cache hit.
[2023-03-11 06:39:33] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/75 places, 87/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 53/75 places, 87/141 transitions.
Stuttering acceptance computed with spot in 378 ms :[(AND (NOT p0) p2 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 1}]], initial=0, aps=[p0:(EQ s1 1), p2:(NEQ s8 1), p1:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-08 finished in 676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Graph (trivial) has 90 edges and 75 vertex of which 10 / 75 are part of one of the 5 SCC in 1 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 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 51 transition count 100
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 51 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 51 transition count 99
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 46 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 46 transition count 87
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 53 place count 46 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 44 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 44 transition count 78
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 63 place count 44 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 43 transition count 71
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 3 with 4 rules applied. Total rules applied 69 place count 41 transition count 85
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 41 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 40 transition count 81
Applied a total of 73 rules in 39 ms. Remains 40 /75 variables (removed 35) and now considering 81/141 (removed 60) transitions.
[2023-03-11 06:39:33] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 40 cols
[2023-03-11 06:39:33] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 06:39:33] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 06:39:33] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2023-03-11 06:39:33] [INFO ] Invariant cache hit.
[2023-03-11 06:39:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 06:39:33] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-11 06:39:34] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-11 06:39:34] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2023-03-11 06:39:34] [INFO ] Invariant cache hit.
[2023-03-11 06:39:34] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/75 places, 81/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 371 ms. Remains : 40/75 places, 81/141 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-09 finished in 432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 56 transition count 104
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 56 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 51 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 51 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 51 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 49 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 49 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 49 transition count 76
Applied a total of 64 rules in 7 ms. Remains 49 /75 variables (removed 26) and now considering 76/141 (removed 65) transitions.
[2023-03-11 06:39:34] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 49 cols
[2023-03-11 06:39:34] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:34] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 06:39:34] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2023-03-11 06:39:34] [INFO ] Invariant cache hit.
[2023-03-11 06:39:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:34] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-11 06:39:34] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2023-03-11 06:39:34] [INFO ] Invariant cache hit.
[2023-03-11 06:39:34] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/75 places, 76/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 49/75 places, 76/141 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (EQ s4 1) (EQ s47 1)), p0:(OR (EQ s3 1) (AND (EQ s4 1) (EQ s47 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-10 finished in 526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G((X(p0)||F(p1))))&&(X(p3)||p2)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 57 transition count 106
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 57 transition count 106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 52 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 52 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 52 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 50 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 50 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 50 transition count 80
Applied a total of 60 rules in 4 ms. Remains 50 /75 variables (removed 25) and now considering 80/141 (removed 61) transitions.
[2023-03-11 06:39:34] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 50 cols
[2023-03-11 06:39:34] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:34] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-11 06:39:34] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 06:39:34] [INFO ] Invariant cache hit.
[2023-03-11 06:39:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:34] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-11 06:39:34] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 06:39:34] [INFO ] Invariant cache hit.
[2023-03-11 06:39:35] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 80/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 50/75 places, 80/141 transitions.
Stuttering acceptance computed with spot in 479 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p1) p0 (NOT p2) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s9 0) (EQ s48 0)), p1:(OR (EQ s9 0) (EQ s48 0)), p3:(EQ s2 0), p0:(EQ s7 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 169 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p1 p3 p0), (X p2), true, (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 423 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 7 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 395 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p1) p0 (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 630 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:39:37] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 06:39:37] [INFO ] Invariant cache hit.
[2023-03-11 06:39:37] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:39:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 06:39:37] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p3 p0), (X p2), true, (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p3)), (G (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p3) p0)), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p3) p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 11 factoid took 678 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLFireability-11 finished in 3288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((p0 U X(p1)) U !p1)||G(p2))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 57 transition count 106
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 57 transition count 106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 52 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 52 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 52 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 50 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 50 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 50 transition count 78
Applied a total of 62 rules in 13 ms. Remains 50 /75 variables (removed 25) and now considering 78/141 (removed 63) transitions.
[2023-03-11 06:39:38] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 50 cols
[2023-03-11 06:39:38] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:38] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 06:39:38] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:38] [INFO ] Invariant cache hit.
[2023-03-11 06:39:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:38] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-11 06:39:38] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:38] [INFO ] Invariant cache hit.
[2023-03-11 06:39:38] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 78/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 50/75 places, 78/141 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s30 1), p0:(AND (EQ s3 1) (EQ s48 1) (EQ s20 1)), p2:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 212 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1494 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 624 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 06:39:41] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:41] [INFO ] Invariant cache hit.
[2023-03-11 06:39:41] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 06:39:41] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-11 06:39:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 06:39:41] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-11 06:39:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:41] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-11 06:39:41] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-11 06:39:41] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2023-03-11 06:39:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-11 06:39:41] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-11 06:39:41] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 78/78 transitions.
Graph (trivial) has 40 edges and 50 vertex of which 10 / 50 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 162 edges and 45 vertex of which 29 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 29 transition count 40
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 21 place count 29 transition count 36
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 25 transition count 36
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 23 transition count 32
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 22 transition count 31
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 22 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 20 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 18 transition count 27
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 18 transition count 23
Applied a total of 46 rules in 10 ms. Remains 18 /50 variables (removed 32) and now considering 23/78 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 18/50 places, 23/78 transitions.
Incomplete random walk after 10000 steps, including 445 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished Best-First random walk after 5567 steps, including 63 resets, run visited all 2 properties in 11 ms. (steps per millisecond=506 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 p1)), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F p2), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 27 factoid took 2428 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), p1, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 380 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), p1, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) p2), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 78/78 transitions.
Applied a total of 0 rules in 0 ms. Remains 50 /50 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-11 06:39:44] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:44] [INFO ] Invariant cache hit.
[2023-03-11 06:39:44] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-11 06:39:44] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:44] [INFO ] Invariant cache hit.
[2023-03-11 06:39:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:45] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-11 06:39:45] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:45] [INFO ] Invariant cache hit.
[2023-03-11 06:39:45] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 50/50 places, 78/78 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (OR (NOT p0) p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 2074 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 472 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), p1, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) p2), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 620 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:39:48] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:48] [INFO ] Invariant cache hit.
[2023-03-11 06:39:48] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 06:39:48] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 06:39:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 06:39:48] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 06:39:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:48] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 06:39:48] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-11 06:39:48] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-11 06:39:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2023-03-11 06:39:48] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 06:39:48] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 78/78 transitions.
Graph (trivial) has 40 edges and 50 vertex of which 10 / 50 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 162 edges and 45 vertex of which 29 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 29 transition count 40
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 21 place count 29 transition count 36
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 25 transition count 36
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 23 transition count 32
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 22 transition count 31
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 22 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 20 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 18 transition count 27
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 18 transition count 23
Applied a total of 46 rules in 9 ms. Remains 18 /50 variables (removed 32) and now considering 23/78 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 18/50 places, 23/78 transitions.
Incomplete random walk after 10000 steps, including 456 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished Best-First random walk after 2119 steps, including 23 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1059 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (OR (NOT p0) p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p2 (NOT p1))), (F (AND p0 (NOT p1))), (F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (AND (NOT p0) p1)), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 25 factoid took 2273 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 289 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 309 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 3 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 127 ms.
Applying partial POR strategy [false, true, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 329 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 78/78 transitions.
Graph (trivial) has 40 edges and 50 vertex of which 10 / 50 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 44 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 44 transition count 71
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 44 transition count 70
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 44 transition count 114
Deduced a syphon composed of 6 places in 0 ms
Drop 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 44 transition count 113
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 12 ms. Remains 44 /50 variables (removed 6) and now considering 113/78 (removed -35) transitions.
[2023-03-11 06:39:52] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-11 06:39:52] [INFO ] Flow matrix only has 98 transitions (discarded 15 similar events)
// Phase 1: matrix 98 rows 44 cols
[2023-03-11 06:39:52] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:52] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/50 places, 113/78 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 44/50 places, 113/78 transitions.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-11 06:39:52] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 50 cols
[2023-03-11 06:39:52] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:52] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 06:39:52] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:52] [INFO ] Invariant cache hit.
[2023-03-11 06:39:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:52] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-11 06:39:52] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 06:39:52] [INFO ] Invariant cache hit.
[2023-03-11 06:39:52] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 50/50 places, 78/78 transitions.
Treatment of property HealthRecord-PT-10-LTLFireability-12 finished in 14643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p1) U (!p2&&G(p1))))||(p3&&X(p4))||p0)))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 60 transition count 112
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 60 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 57 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 57 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 57 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 56 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 56 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 56 transition count 97
Applied a total of 44 rules in 2 ms. Remains 56 /75 variables (removed 19) and now considering 97/141 (removed 44) transitions.
[2023-03-11 06:39:52] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
// Phase 1: matrix 94 rows 56 cols
[2023-03-11 06:39:52] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:39:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 06:39:52] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
[2023-03-11 06:39:52] [INFO ] Invariant cache hit.
[2023-03-11 06:39:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:39:52] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-11 06:39:52] [INFO ] Flow matrix only has 94 transitions (discarded 3 similar events)
[2023-03-11 06:39:52] [INFO ] Invariant cache hit.
[2023-03-11 06:39:52] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/75 places, 97/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 56/75 places, 97/141 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p4))), (OR (NOT p1) p2), (OR (AND p2 p3 (NOT p4)) (AND p0 p2 (NOT p4)) (AND (NOT p1) (NOT p4))), true, (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND p0 p2 p1 (NOT p4)) (AND p3 p2 p1 (NOT p4))), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s7 1) (EQ s55 1) (EQ s28 1)), p3:(EQ s31 1), p2:(NEQ s7 1), p1:(EQ s28 1), p4:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLFireability-13 finished in 511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||((p1 U X(p1))&&F((G(p3)&&p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((p0 U X(p1)) U !p1)||G(p2))))'
Found a Lengthening insensitive property : HealthRecord-PT-10-LTLFireability-12
Stuttering acceptance computed with spot in 305 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 75/75 places, 141/141 transitions.
Graph (trivial) has 76 edges and 75 vertex of which 10 / 75 are part of one of the 5 SCC in 1 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 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 52 transition count 102
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 52 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 52 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 47 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 47 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 52 place count 47 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 45 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 45 transition count 79
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 45 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 44 transition count 72
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 3 with 4 rules applied. Total rules applied 68 place count 42 transition count 86
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 42 transition count 85
Applied a total of 69 rules in 26 ms. Remains 42 /75 variables (removed 33) and now considering 85/141 (removed 56) transitions.
[2023-03-11 06:39:53] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
// Phase 1: matrix 76 rows 42 cols
[2023-03-11 06:39:53] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 06:39:53] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 06:39:53] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-11 06:39:53] [INFO ] Invariant cache hit.
[2023-03-11 06:39:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 06:39:53] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-11 06:39:53] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-11 06:39:53] [INFO ] Invariant cache hit.
[2023-03-11 06:39:54] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 42/75 places, 85/141 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 261 ms. Remains : 42/75 places, 85/141 transitions.
Running random walk in product with property : HealthRecord-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s26 1), p0:(AND (EQ s2 1) (EQ s40 1) (EQ s16 1)), p2:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 138 ms.
Computed a total of 14 stabilizing places and 29 stable transitions
Computed a total of 14 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1675 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 895 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:39:56] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-11 06:39:56] [INFO ] Invariant cache hit.
[2023-03-11 06:39:56] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 06:39:56] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-11 06:39:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 06:39:56] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-11 06:39:56] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 06:39:56] [INFO ] After 24ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-11 06:39:56] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 06:39:57] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 85/85 transitions.
Graph (complete) has 152 edges and 42 vertex of which 26 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 26 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 21 place count 26 transition count 52
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 22 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 22 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 21 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 21 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 20 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 20 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 18 transition count 42
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 18 transition count 38
Applied a total of 42 rules in 10 ms. Remains 18 /42 variables (removed 24) and now considering 38/85 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 18/42 places, 38/85 transitions.
Incomplete random walk after 10000 steps, including 611 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1587 steps, run visited all 2 properties in 9 ms. (steps per millisecond=176 )
Probabilistic random walk after 1587 steps, saw 463 distinct states, run finished after 9 ms. (steps per millisecond=176 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 p1)), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F p2), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 27 factoid took 2765 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), p1, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 397 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), p1, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) p2), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 85/85 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-11 06:40:00] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-11 06:40:00] [INFO ] Invariant cache hit.
[2023-03-11 06:40:00] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 06:40:00] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-11 06:40:00] [INFO ] Invariant cache hit.
[2023-03-11 06:40:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 06:40:00] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-11 06:40:00] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-11 06:40:00] [INFO ] Invariant cache hit.
[2023-03-11 06:40:00] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 42/42 places, 85/85 transitions.
Computed a total of 14 stabilizing places and 29 stable transitions
Computed a total of 14 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (OR (NOT p0) p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1743 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), p1, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) p2), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 905 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 06:40:03] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-11 06:40:03] [INFO ] Invariant cache hit.
[2023-03-11 06:40:03] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 06:40:03] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-11 06:40:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 06:40:03] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-11 06:40:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 06:40:03] [INFO ] After 30ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-11 06:40:03] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-11 06:40:03] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 85/85 transitions.
Graph (complete) has 152 edges and 42 vertex of which 26 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 26 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 21 place count 26 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 22 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 22 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 21 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 21 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 20 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 20 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 18 transition count 42
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 18 transition count 38
Applied a total of 42 rules in 7 ms. Remains 18 /42 variables (removed 24) and now considering 38/85 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 18/42 places, 38/85 transitions.
Incomplete random walk after 10000 steps, including 594 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :1
Finished Best-First random walk after 5005 steps, including 47 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1668 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (OR (NOT p0) p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p2 (NOT p1))), (F (AND p0 (NOT p1))), (F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (AND (NOT p0) p1)), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 25 factoid took 2159 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 324 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 260 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 64 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Applying partial POR strategy [false, true, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 282 ms :[(AND p1 (NOT p2)), (NOT p1), p1, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 85/85 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 83
Applied a total of 2 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 83/85 (removed 2) transitions.
[2023-03-11 06:40:07] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 06:40:07] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-11 06:40:07] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:40:07] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/42 places, 83/85 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 42/42 places, 83/85 transitions.
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-11 06:40:07] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
// Phase 1: matrix 76 rows 42 cols
[2023-03-11 06:40:07] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:40:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 06:40:07] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-11 06:40:07] [INFO ] Invariant cache hit.
[2023-03-11 06:40:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 06:40:07] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-11 06:40:07] [INFO ] Flow matrix only has 76 transitions (discarded 9 similar events)
[2023-03-11 06:40:07] [INFO ] Invariant cache hit.
[2023-03-11 06:40:07] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 42/42 places, 85/85 transitions.
Treatment of property HealthRecord-PT-10-LTLFireability-12 finished in 14512 ms.
[2023-03-11 06:40:07] [INFO ] Flatten gal took : 14 ms
[2023-03-11 06:40:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 06:40:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 141 transitions and 438 arcs took 2 ms.
Total runtime 56182 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HealthRecord-PT-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLFireability

FORMULA HealthRecord-PT-10-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HealthRecord-PT-10-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HealthRecord-PT-10-LTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678516809407

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 HealthRecord-PT-10-LTLFireability-07
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for HealthRecord-PT-10-LTLFireability-07
lola: result : false
lola: markings : 25155
lola: fired transitions : 70893
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 HealthRecord-PT-10-LTLFireability-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for HealthRecord-PT-10-LTLFireability-12
lola: result : false
lola: markings : 246
lola: fired transitions : 655
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 HealthRecord-PT-10-LTLFireability-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for HealthRecord-PT-10-LTLFireability-03
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HealthRecord-PT-10-LTLFireability-03: LTL true LTL model checker
HealthRecord-PT-10-LTLFireability-07: LTL false LTL model checker
HealthRecord-PT-10-LTLFireability-12: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is HealthRecord-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r199-smll-167840345800308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-10.tgz
mv HealthRecord-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;