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.r201-smll-167840347600332.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 ltsminxred
Input is HealthRecord-PT-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347600332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 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 71K 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-13-LTLFireability-00
FORMULA_NAME HealthRecord-PT-13-LTLFireability-01
FORMULA_NAME HealthRecord-PT-13-LTLFireability-02
FORMULA_NAME HealthRecord-PT-13-LTLFireability-03
FORMULA_NAME HealthRecord-PT-13-LTLFireability-04
FORMULA_NAME HealthRecord-PT-13-LTLFireability-05
FORMULA_NAME HealthRecord-PT-13-LTLFireability-06
FORMULA_NAME HealthRecord-PT-13-LTLFireability-07
FORMULA_NAME HealthRecord-PT-13-LTLFireability-08
FORMULA_NAME HealthRecord-PT-13-LTLFireability-09
FORMULA_NAME HealthRecord-PT-13-LTLFireability-10
FORMULA_NAME HealthRecord-PT-13-LTLFireability-11
FORMULA_NAME HealthRecord-PT-13-LTLFireability-12
FORMULA_NAME HealthRecord-PT-13-LTLFireability-13
FORMULA_NAME HealthRecord-PT-13-LTLFireability-14
FORMULA_NAME HealthRecord-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678640499218

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:01:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:01:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:01:42] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-12 17:01:42] [INFO ] Transformed 161 places.
[2023-03-12 17:01:42] [INFO ] Transformed 341 transitions.
[2023-03-12 17:01:42] [INFO ] Found NUPN structural information;
[2023-03-12 17:01:42] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-13-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 84 transition count 168
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 84 transition count 168
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 157 place count 81 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 160 place count 81 transition count 162
Applied a total of 160 rules in 63 ms. Remains 81 /161 variables (removed 80) and now considering 162/313 (removed 151) transitions.
[2023-03-12 17:01:43] [INFO ] Flow matrix only has 159 transitions (discarded 3 similar events)
// Phase 1: matrix 159 rows 81 cols
[2023-03-12 17:01:43] [INFO ] Computed 9 place invariants in 16 ms
[2023-03-12 17:01:43] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-12 17:01:43] [INFO ] Flow matrix only has 159 transitions (discarded 3 similar events)
[2023-03-12 17:01:43] [INFO ] Invariant cache hit.
[2023-03-12 17:01:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:01:43] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-12 17:01:43] [INFO ] Flow matrix only has 159 transitions (discarded 3 similar events)
[2023-03-12 17:01:43] [INFO ] Invariant cache hit.
[2023-03-12 17:01:43] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/161 places, 162/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 945 ms. Remains : 81/161 places, 162/313 transitions.
Support contains 30 out of 81 places after structural reductions.
[2023-03-12 17:01:44] [INFO ] Flatten gal took : 69 ms
[2023-03-12 17:01:44] [INFO ] Flatten gal took : 30 ms
[2023-03-12 17:01:44] [INFO ] Input system was already deterministic with 162 transitions.
Incomplete random walk after 10000 steps, including 778 resets, run finished after 999 ms. (steps per millisecond=10 ) properties (out of 34) seen :12
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-12 17:01:45] [INFO ] Flow matrix only has 159 transitions (discarded 3 similar events)
[2023-03-12 17:01:45] [INFO ] Invariant cache hit.
[2023-03-12 17:01:45] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 17:01:45] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2023-03-12 17:01:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-03-12 17:01:46] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2023-03-12 17:01:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:01:46] [INFO ] After 194ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :19
[2023-03-12 17:01:46] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 9 ms to minimize.
[2023-03-12 17:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-12 17:01:46] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-12 17:01:46] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2023-03-12 17:01:47] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:01:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2023-03-12 17:01:47] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2023-03-12 17:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-12 17:01:47] [INFO ] After 974ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-12 17:01:47] [INFO ] After 1652ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 20 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 21 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 162/162 transitions.
Graph (trivial) has 51 edges and 81 vertex of which 8 / 81 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 317 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 76 transition count 147
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 73 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 73 transition count 145
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 72 transition count 145
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 19 place count 64 transition count 129
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 64 transition count 129
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 62 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 62 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 61 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 61 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 57 transition count 141
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 57 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 57 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 56 transition count 139
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 59 place count 56 transition count 139
Applied a total of 59 rules in 65 ms. Remains 56 /81 variables (removed 25) and now considering 139/162 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 56/81 places, 139/162 transitions.
Incomplete random walk after 10000 steps, including 730 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 19) seen :13
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 155 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 142 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-03-12 17:01:48] [INFO ] Flow matrix only has 130 transitions (discarded 9 similar events)
// Phase 1: matrix 130 rows 56 cols
[2023-03-12 17:01:48] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-12 17:01:48] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 17:01:48] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 17:01:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 17:01:48] [INFO ] After 10ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 17:01:48] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2023-03-12 17:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-12 17:01:48] [INFO ] After 101ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:01:48] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:01:48] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 17:01:48] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:01:48] [INFO ] After 14ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:01:48] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2023-03-12 17:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-12 17:01:48] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 17:01:48] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 139/139 transitions.
Graph (complete) has 240 edges and 56 vertex of which 46 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 46 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 34 place count 46 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 45 transition count 104
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 52 place count 29 transition count 72
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 29 transition count 72
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 85 place count 29 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 85 place count 29 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 26 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 21 transition count 47
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 21 transition count 47
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 110 place count 21 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 19 transition count 35
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 19 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 19 transition count 33
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 18 transition count 32
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 18 transition count 32
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 121 place count 18 transition count 29
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 5 with 2 rules applied. Total rules applied 123 place count 17 transition count 28
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 17 transition count 28
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 129 place count 17 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 16 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 131 place count 15 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 131 place count 15 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 133 place count 14 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 137 place count 12 transition count 20
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 141 place count 12 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 142 place count 12 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 144 place count 11 transition count 14
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 147 place count 11 transition count 11
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 148 place count 11 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 149 place count 11 transition count 10
Applied a total of 149 rules in 28 ms. Remains 11 /56 variables (removed 45) and now considering 10/139 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 11/56 places, 10/139 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=10 )
FORMULA HealthRecord-PT-13-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 8 stabilizing places and 12 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' '!(F((p0&&(F(p1) U (p2 U X(G(p0))))&&G(p2))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Graph (trivial) has 93 edges and 81 vertex of which 8 / 81 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 57 transition count 118
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 57 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 42 place count 57 transition count 115
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 51 transition count 103
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 51 transition count 103
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 51 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 49 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 49 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 47 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 47 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 74 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 46 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 46 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 44 transition count 95
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 44 transition count 93
Applied a total of 83 rules in 53 ms. Remains 44 /81 variables (removed 37) and now considering 93/162 (removed 69) transitions.
[2023-03-12 17:01:49] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
// Phase 1: matrix 84 rows 44 cols
[2023-03-12 17:01:49] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 17:01:49] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 17:01:49] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
[2023-03-12 17:01:49] [INFO ] Invariant cache hit.
[2023-03-12 17:01:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 17:01:49] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-12 17:01:49] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-12 17:01:49] [INFO ] Flow matrix only has 84 transitions (discarded 9 similar events)
[2023-03-12 17:01:49] [INFO ] Invariant cache hit.
[2023-03-12 17:01:49] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/81 places, 93/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 426 ms. Remains : 44/81 places, 93/162 transitions.
Stuttering acceptance computed with spot in 798 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={1} source=0 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 0}, { cond=p2, acceptance={1} source=3 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s11 1), p2:(EQ s27 1), p1:(EQ s37 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-00 finished in 1345 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)||X(F((p1&&X(p2))))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 63 transition count 125
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 63 transition count 125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 57 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 57 transition count 113
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 57 place count 57 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 55 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 55 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 53 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 53 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 53 transition count 88
Applied a total of 71 rules in 27 ms. Remains 53 /81 variables (removed 28) and now considering 88/162 (removed 74) transitions.
[2023-03-12 17:01:50] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2023-03-12 17:01:50] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 17:01:50] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 17:01:50] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-12 17:01:50] [INFO ] Invariant cache hit.
[2023-03-12 17:01:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:01:50] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-12 17:01:50] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-12 17:01:50] [INFO ] Invariant cache hit.
[2023-03-12 17:01:51] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/81 places, 88/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 53/81 places, 88/162 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s36 0) (EQ s40 0)), p2:(EQ s31 1), p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-01 finished in 726 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(G((p0||F(((X(X(!p1))&&G(p2))||G(!p1)))))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 62 transition count 123
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 62 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 62 transition count 120
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 55 transition count 106
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 55 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 55 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 53 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 53 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 52 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 52 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 52 transition count 87
Applied a total of 72 rules in 12 ms. Remains 52 /81 variables (removed 29) and now considering 87/162 (removed 75) transitions.
[2023-03-12 17:01:51] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2023-03-12 17:01:51] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 17:01:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 17:01:51] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2023-03-12 17:01:51] [INFO ] Invariant cache hit.
[2023-03-12 17:01:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:01:51] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-12 17:01:51] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2023-03-12 17:01:51] [INFO ] Invariant cache hit.
[2023-03-12 17:01:51] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/81 places, 87/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 52/81 places, 87/162 transitions.
Stuttering acceptance computed with spot in 506 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND (NOT p2) p1), p1, p1, (AND (NOT p2) p1)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 6}, { cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p1 p2), acceptance={0} source=6 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=7 dest: 4}]], initial=0, aps=[p0:(EQ s13 0), p2:(NEQ s12 1), p1:(AND (EQ s36 1) (EQ s41 1))], nbAcceptance=2, 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 5 reset in 463 ms.
Product exploration explored 100000 steps with 18 reset in 277 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 1061 ms. Reduced automaton from 8 states, 29 edges and 3 AP (stutter sensitive) to 8 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND (NOT p2) p1), p1, p1, (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 786 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
[2023-03-12 17:01:55] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2023-03-12 17:01:55] [INFO ] Invariant cache hit.
[2023-03-12 17:01:55] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 17:01:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 17:01:55] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 17:01:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:01:55] [INFO ] After 39ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 17:01:55] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-12 17:01:55] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 87/87 transitions.
Graph (trivial) has 43 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 178 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 74
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 72
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 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 44 transition count 70
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 11 place count 43 transition count 70
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -35
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 23 place count 37 transition count 105
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 37 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 37 transition count 197
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 36 transition count 194
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 36 transition count 193
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 35 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 35 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 34 transition count 142
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 34 transition count 142
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 44 place count 34 transition count 132
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 53 place count 34 transition count 132
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 34 transition count 132
Applied a total of 54 rules in 85 ms. Remains 34 /52 variables (removed 18) and now considering 132/87 (removed -45) transitions.
[2023-03-12 17:01:55] [INFO ] Flow matrix only has 108 transitions (discarded 24 similar events)
// Phase 1: matrix 108 rows 34 cols
[2023-03-12 17:01:55] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-12 17:01:55] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 34/52 places, 132/87 transitions.
Finished random walk after 1006 steps, including 93 resets, run visited all 3 properties in 22 ms. (steps per millisecond=45 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 11 factoid took 1256 ms. Reduced automaton from 8 states, 29 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 (NOT p2)), p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 484 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 (NOT p2)), p1, p1, (AND p1 (NOT p2))]
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-12 17:01:57] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2023-03-12 17:01:57] [INFO ] Computed 9 place invariants in 9 ms
[2023-03-12 17:01:57] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 17:01:57] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2023-03-12 17:01:57] [INFO ] Invariant cache hit.
[2023-03-12 17:01:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:01:58] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-12 17:01:58] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2023-03-12 17:01:58] [INFO ] Invariant cache hit.
[2023-03-12 17:01:58] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 52/52 places, 87/87 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 927 ms. Reduced automaton from 8 states, 28 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 477 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 (NOT p2)), p1, p1, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 779 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:02:00] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2023-03-12 17:02:00] [INFO ] Invariant cache hit.
[2023-03-12 17:02:00] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-12 17:02:00] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 17:02:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:00] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 17:02:00] [INFO ] After 28ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:02:00] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:02:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-12 17:02:00] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:02:00] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:02:00] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-12 17:02:00] [INFO ] After 188ms 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 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 87/87 transitions.
Graph (trivial) has 45 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 178 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 74
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 72
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 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 44 transition count 70
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 11 place count 43 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 42 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 42 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 42 transition count 67
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 26 place count 36 transition count 102
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 36 transition count 101
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 36 transition count 192
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 32 place count 35 transition count 189
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 33 place count 35 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 34 place count 34 transition count 140
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 34 transition count 140
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 36 place count 33 transition count 138
Iterating global reduction 5 with 1 rules applied. Total rules applied 37 place count 33 transition count 138
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 47 place count 33 transition count 128
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 56 place count 33 transition count 128
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 57 place count 33 transition count 128
Applied a total of 57 rules in 51 ms. Remains 33 /52 variables (removed 19) and now considering 128/87 (removed -41) transitions.
[2023-03-12 17:02:00] [INFO ] Flow matrix only has 104 transitions (discarded 24 similar events)
// Phase 1: matrix 104 rows 33 cols
[2023-03-12 17:02:00] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 17:02:00] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 33/52 places, 128/87 transitions.
Finished random walk after 825 steps, including 78 resets, run visited all 2 properties in 5 ms. (steps per millisecond=165 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 8 factoid took 1062 ms. Reduced automaton from 8 states, 28 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 (NOT p2)), p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 474 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 (NOT p2)), p1, p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 (NOT p2)), p1, p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 3 reset in 182 ms.
Product exploration explored 100000 steps with 7 reset in 216 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 87/87 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-12 17:02:03] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2023-03-12 17:02:03] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 17:02:03] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 17:02:03] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2023-03-12 17:02:03] [INFO ] Invariant cache hit.
[2023-03-12 17:02:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:03] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-12 17:02:03] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2023-03-12 17:02:03] [INFO ] Invariant cache hit.
[2023-03-12 17:02:03] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 52/52 places, 87/87 transitions.
Treatment of property HealthRecord-PT-13-LTLFireability-04 finished in 12643 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 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Graph (trivial) has 96 edges and 81 vertex of which 8 / 81 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 56 transition count 116
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 56 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 44 place count 56 transition count 113
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 49 transition count 99
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 49 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 67 place count 49 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 48 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 48 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 47 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 47 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 47 transition count 82
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 76 place count 46 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 46 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 44 transition count 99
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 44 transition count 97
Applied a total of 83 rules in 32 ms. Remains 44 /81 variables (removed 37) and now considering 97/162 (removed 65) transitions.
[2023-03-12 17:02:04] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
// Phase 1: matrix 88 rows 44 cols
[2023-03-12 17:02:04] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-12 17:02:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-12 17:02:04] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-12 17:02:04] [INFO ] Invariant cache hit.
[2023-03-12 17:02:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-12 17:02:04] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-12 17:02:04] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-12 17:02:04] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-12 17:02:04] [INFO ] Invariant cache hit.
[2023-03-12 17:02:04] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/81 places, 97/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 44/81 places, 97/162 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 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-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-05 finished in 474 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(p0)))'
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 121
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 61 transition count 118
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 55 transition count 106
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 55 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 55 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 54 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 54 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 53 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 53 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 53 transition count 89
Applied a total of 71 rules in 12 ms. Remains 53 /81 variables (removed 28) and now considering 89/162 (removed 73) transitions.
[2023-03-12 17:02:04] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 53 cols
[2023-03-12 17:02:04] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 17:02:04] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-12 17:02:04] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-12 17:02:04] [INFO ] Invariant cache hit.
[2023-03-12 17:02:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:04] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-12 17:02:04] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-12 17:02:04] [INFO ] Invariant cache hit.
[2023-03-12 17:02:04] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/81 places, 89/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 53/81 places, 89/162 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-06 finished in 477 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(X(F(p1)))&&p0))&&(p2 U (p3||G(p2)))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 121
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 61 transition count 118
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 55 transition count 106
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 55 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 55 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 53 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 53 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 51 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 51 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 51 transition count 81
Applied a total of 78 rules in 10 ms. Remains 51 /81 variables (removed 30) and now considering 81/162 (removed 81) transitions.
[2023-03-12 17:02:05] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 51 cols
[2023-03-12 17:02:05] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 17:02:05] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 17:02:05] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2023-03-12 17:02:05] [INFO ] Invariant cache hit.
[2023-03-12 17:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:05] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-12 17:02:05] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2023-03-12 17:02:05] [INFO ] Invariant cache hit.
[2023-03-12 17:02:05] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/81 places, 81/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 51/81 places, 81/162 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s12 1) (EQ s49 1))) (NEQ s38 1)), p2:(NEQ s38 1), p0:(AND (EQ s12 1) (EQ s49 1)), p1:(EQ s38 0)], 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-07 finished in 623 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)||(p1 U X(!p1))))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 121
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 61 transition count 118
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 54 transition count 104
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 54 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 66 place count 54 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 52 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 52 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 50 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 50 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 80 place count 50 transition count 79
Applied a total of 80 rules in 10 ms. Remains 50 /81 variables (removed 31) and now considering 79/162 (removed 83) transitions.
[2023-03-12 17:02:05] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2023-03-12 17:02:05] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 17:02:05] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 17:02:05] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-12 17:02:05] [INFO ] Invariant cache hit.
[2023-03-12 17:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:05] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-12 17:02:05] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-12 17:02:05] [INFO ] Invariant cache hit.
[2023-03-12 17:02:05] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/81 places, 79/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 50/81 places, 79/162 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), p1, p1]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s8 1) (EQ s12 1) (EQ s48 1)), p1:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 686 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-13-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-13-LTLFireability-08 finished in 1861 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(X(F(p0))))&&F(((p1&&X(F(p2)))||G(F(p2))))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 62 transition count 123
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 62 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 62 transition count 120
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 55 transition count 106
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 55 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 55 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 53 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 53 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 51 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 51 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 51 transition count 81
Applied a total of 78 rules in 11 ms. Remains 51 /81 variables (removed 30) and now considering 81/162 (removed 81) transitions.
[2023-03-12 17:02:07] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 51 cols
[2023-03-12 17:02:07] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 17:02:07] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 17:02:07] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2023-03-12 17:02:07] [INFO ] Invariant cache hit.
[2023-03-12 17:02:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:07] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-12 17:02:07] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2023-03-12 17:02:07] [INFO ] Invariant cache hit.
[2023-03-12 17:02:07] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/81 places, 81/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 51/81 places, 81/162 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s4 1), p2:(NEQ s46 1), p0:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-09 finished in 846 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(X(p1))&&p0)))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 122
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 61 transition count 119
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 55 transition count 107
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 55 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 53 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 53 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 51 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 51 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 75 place count 51 transition count 85
Applied a total of 75 rules in 10 ms. Remains 51 /81 variables (removed 30) and now considering 85/162 (removed 77) transitions.
[2023-03-12 17:02:08] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 51 cols
[2023-03-12 17:02:08] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 17:02:08] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-12 17:02:08] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2023-03-12 17:02:08] [INFO ] Invariant cache hit.
[2023-03-12 17:02:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:08] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-12 17:02:08] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2023-03-12 17:02:08] [INFO ] Invariant cache hit.
[2023-03-12 17:02:08] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/81 places, 85/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 495 ms. Remains : 51/81 places, 85/162 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 4}]], initial=2, aps=[p0:(AND (EQ s4 1) (EQ s49 1)), p1:(EQ s40 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-10 finished in 891 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(p0)||G(p1)))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 121
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 61 transition count 118
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 54 transition count 104
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 54 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 66 place count 54 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 52 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 52 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 50 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 50 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 80 place count 50 transition count 79
Applied a total of 80 rules in 8 ms. Remains 50 /81 variables (removed 31) and now considering 79/162 (removed 83) transitions.
[2023-03-12 17:02:09] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2023-03-12 17:02:09] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 17:02:09] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 17:02:09] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-12 17:02:09] [INFO ] Invariant cache hit.
[2023-03-12 17:02:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:09] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-12 17:02:09] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-12 17:02:09] [INFO ] Invariant cache hit.
[2023-03-12 17:02:09] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/81 places, 79/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 50/81 places, 79/162 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(EQ s4 1), p0:(EQ s49 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-11 finished in 530 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(F(((p1 U p2)||p0))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Graph (trivial) has 87 edges and 81 vertex of which 8 / 81 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 57 transition count 118
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 57 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 42 place count 57 transition count 115
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 51 transition count 103
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 51 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 63 place count 51 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 50 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 50 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 49 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 49 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 49 transition count 86
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 72 place count 48 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 48 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 77 place count 46 transition count 101
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 46 transition count 99
Applied a total of 79 rules in 47 ms. Remains 46 /81 variables (removed 35) and now considering 99/162 (removed 63) transitions.
[2023-03-12 17:02:09] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
// Phase 1: matrix 90 rows 46 cols
[2023-03-12 17:02:09] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-12 17:02:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-12 17:02:09] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-12 17:02:09] [INFO ] Invariant cache hit.
[2023-03-12 17:02:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 17:02:10] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-12 17:02:10] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-12 17:02:10] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-12 17:02:10] [INFO ] Invariant cache hit.
[2023-03-12 17:02:10] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/81 places, 99/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 555 ms. Remains : 46/81 places, 99/162 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s10 1) (OR (EQ s5 1) (EQ s10 1))), p0:(OR (EQ s5 1) (EQ s10 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-12 finished in 696 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((p0&&X((p1&&X(G(p2))))))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 63 transition count 125
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 63 transition count 125
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 63 transition count 122
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 56 transition count 108
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 56 transition count 108
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 61 place count 56 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 54 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 54 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 52 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 52 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 75 place count 52 transition count 84
Applied a total of 75 rules in 7 ms. Remains 52 /81 variables (removed 29) and now considering 84/162 (removed 78) transitions.
[2023-03-12 17:02:10] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 52 cols
[2023-03-12 17:02:10] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-12 17:02:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 17:02:10] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2023-03-12 17:02:10] [INFO ] Invariant cache hit.
[2023-03-12 17:02:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:10] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-12 17:02:10] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2023-03-12 17:02:10] [INFO ] Invariant cache hit.
[2023-03-12 17:02:10] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/81 places, 84/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 52/81 places, 84/162 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s4 0), p1:(EQ s13 1), p2:(AND (EQ s20 0) (EQ s4 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-13 finished in 739 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' '!((((p0||G(p1)) U X(X(G(p2)))) U G(p2)))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 162/162 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 62 transition count 123
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 62 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 62 transition count 120
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 57 transition count 110
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 57 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 57 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 56 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 56 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 55 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 55 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 55 transition count 96
Applied a total of 64 rules in 7 ms. Remains 55 /81 variables (removed 26) and now considering 96/162 (removed 66) transitions.
[2023-03-12 17:02:11] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
// Phase 1: matrix 93 rows 55 cols
[2023-03-12 17:02:11] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 17:02:11] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-12 17:02:11] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2023-03-12 17:02:11] [INFO ] Invariant cache hit.
[2023-03-12 17:02:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:02:11] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-12 17:02:11] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2023-03-12 17:02:11] [INFO ] Invariant cache hit.
[2023-03-12 17:02:11] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/81 places, 96/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 55/81 places, 96/162 transitions.
Stuttering acceptance computed with spot in 390 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s41 1), p0:(EQ s31 1), p1:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-14 finished in 873 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(G((p0||F(((X(X(!p1))&&G(p2))||G(!p1)))))))'
[2023-03-12 17:02:12] [INFO ] Flatten gal took : 47 ms
[2023-03-12 17:02:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 17:02:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 81 places, 162 transitions and 511 arcs took 7 ms.
Total runtime 30014 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1406/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HealthRecord-PT-13-LTLFireability-04

BK_STOP 1678640534255

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
mcc2023
ltl formula name HealthRecord-PT-13-LTLFireability-04
ltl formula formula --ltl=/tmp/1406/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 81 places, 162 transitions and 511 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1406/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1406/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1406/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1406/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 13 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-13, 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 r201-smll-167840347600332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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