Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477300172.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r114-smll-165264477300172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 6.6K Apr 30 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 11:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 11:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 71K May 10 09:34 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 1652694959920

Running Version 202205111006
[2022-05-16 09:56:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:56:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:56:02] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2022-05-16 09:56:02] [INFO ] Transformed 161 places.
[2022-05-16 09:56:02] [INFO ] Transformed 341 transitions.
[2022-05-16 09:56:02] [INFO ] Found NUPN structural information;
[2022-05-16 09:56:02] [INFO ] Parsed PT model containing 161 places and 341 transitions in 563 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 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-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 85 transition count 168
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 85 transition count 168
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 157 place count 80 transition count 158
Iterating global reduction 0 with 5 rules applied. Total rules applied 162 place count 80 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 168 place count 80 transition count 152
Applied a total of 168 rules in 51 ms. Remains 80 /161 variables (removed 81) and now considering 152/313 (removed 161) transitions.
[2022-05-16 09:56:03] [INFO ] Flow matrix only has 147 transitions (discarded 5 similar events)
// Phase 1: matrix 147 rows 80 cols
[2022-05-16 09:56:03] [INFO ] Computed 11 place invariants in 21 ms
[2022-05-16 09:56:03] [INFO ] Implicit Places using invariants in 356 ms returned []
[2022-05-16 09:56:03] [INFO ] Flow matrix only has 147 transitions (discarded 5 similar events)
// Phase 1: matrix 147 rows 80 cols
[2022-05-16 09:56:03] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 09:56:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:56:03] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2022-05-16 09:56:03] [INFO ] Flow matrix only has 147 transitions (discarded 5 similar events)
// Phase 1: matrix 147 rows 80 cols
[2022-05-16 09:56:03] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 09:56:04] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/161 places, 152/313 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/161 places, 152/313 transitions.
Support contains 39 out of 80 places after structural reductions.
[2022-05-16 09:56:04] [INFO ] Flatten gal took : 88 ms
[2022-05-16 09:56:04] [INFO ] Flatten gal took : 38 ms
[2022-05-16 09:56:04] [INFO ] Input system was already deterministic with 152 transitions.
Incomplete random walk after 10000 steps, including 779 resets, run finished after 1188 ms. (steps per millisecond=8 ) properties (out of 28) seen :12
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2022-05-16 09:56:06] [INFO ] Flow matrix only has 147 transitions (discarded 5 similar events)
// Phase 1: matrix 147 rows 80 cols
[2022-05-16 09:56:06] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 09:56:06] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-16 09:56:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 09:56:06] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-16 09:56:07] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :14
[2022-05-16 09:56:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:56:07] [INFO ] After 160ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :14
[2022-05-16 09:56:07] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 11 ms to minimize.
[2022-05-16 09:56:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-16 09:56:07] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2022-05-16 09:56:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-16 09:56:07] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2022-05-16 09:56:07] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2022-05-16 09:56:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2022-05-16 09:56:07] [INFO ] After 766ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :14
Attempting to minimize the solution found.
Minimization took 136 ms.
[2022-05-16 09:56:07] [INFO ] After 1514ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :14
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 26 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 24 edges and 80 vertex of which 6 / 80 are part of one of the 3 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 320 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 11 place count 67 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 20 place count 67 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 67 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 65 transition count 118
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 65 transition count 118
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 1 with 2 rules applied. Total rules applied 27 place count 64 transition count 117
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 64 transition count 113
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 60 transition count 113
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 60 transition count 113
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 60 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 59 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 59 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 58 transition count 110
Applied a total of 41 rules in 87 ms. Remains 58 /80 variables (removed 22) and now considering 110/152 (removed 42) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/80 places, 110/152 transitions.
Incomplete random walk after 10000 steps, including 1012 resets, run finished after 599 ms. (steps per millisecond=16 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 185 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 179 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 189 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-16 09:56:09] [INFO ] Flow matrix only has 101 transitions (discarded 9 similar events)
// Phase 1: matrix 101 rows 58 cols
[2022-05-16 09:56:09] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 09:56:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 09:56:09] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:56:09] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-16 09:56:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 09:56:09] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:56:09] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-16 09:56:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2022-05-16 09:56:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-05-16 09:56:09] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-16 09:56:09] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2022-05-16 09:56:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2022-05-16 09:56:09] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2022-05-16 09:56:09] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2022-05-16 09:56:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2022-05-16 09:56:09] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 50 ms.
[2022-05-16 09:56:10] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 31 ms.
Support contains 9 out of 58 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 58/58 places, 110/110 transitions.
Graph (complete) has 237 edges and 58 vertex of which 56 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 56 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 55 transition count 109
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 53 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 53 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 52 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 51 transition count 115
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 18 place count 51 transition count 108
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 25 place count 44 transition count 108
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 44 transition count 107
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 1 with 21 rules applied. Total rules applied 47 place count 44 transition count 107
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 66 place count 44 transition count 107
Applied a total of 66 rules in 60 ms. Remains 44 /58 variables (removed 14) and now considering 107/110 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 44/58 places, 107/110 transitions.
Incomplete random walk after 10000 steps, including 642 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
[2022-05-16 09:56:11] [INFO ] Flow matrix only has 91 transitions (discarded 16 similar events)
// Phase 1: matrix 91 rows 44 cols
[2022-05-16 09:56:11] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-16 09:56:11] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:56:11] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 09:56:11] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:56:11] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 09:56:11] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-16 09:56:11] [INFO ] After 32ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-16 09:56:11] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-16 09:56:11] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 44/44 places, 107/107 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 43 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 42 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 42 transition count 104
Applied a total of 5 rules in 20 ms. Remains 42 /44 variables (removed 2) and now considering 104/107 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 42/44 places, 104/107 transitions.
Incomplete random walk after 10000 steps, including 654 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 124 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2139 steps, run visited all 3 properties in 53 ms. (steps per millisecond=40 )
Probabilistic random walk after 2139 steps, saw 616 distinct states, run finished after 53 ms. (steps per millisecond=40 ) properties seen :3
FORMULA HealthRecord-PT-13-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA HealthRecord-PT-13-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 12 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(X(p0))))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 63 transition count 120
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 63 transition count 120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 59 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 59 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 57 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 57 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 56 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 56 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 56 transition count 101
Applied a total of 51 rules in 14 ms. Remains 56 /80 variables (removed 24) and now considering 101/152 (removed 51) transitions.
[2022-05-16 09:56:12] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
// Phase 1: matrix 98 rows 56 cols
[2022-05-16 09:56:12] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 09:56:12] [INFO ] Implicit Places using invariants in 82 ms returned []
[2022-05-16 09:56:12] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
// Phase 1: matrix 98 rows 56 cols
[2022-05-16 09:56:12] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 09:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:56:12] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2022-05-16 09:56:12] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
// Phase 1: matrix 98 rows 56 cols
[2022-05-16 09:56:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:12] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/80 places, 101/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/80 places, 101/152 transitions.
Stuttering acceptance computed with spot in 484 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s32 1) (EQ s4 1) (OR (EQ s30 1) (AND (EQ s9 1) (EQ s54 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-01 finished in 946 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(G(p2))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 62 transition count 118
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 62 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 59 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 59 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 59 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 57 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 57 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 55 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 55 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 55 transition count 93
Applied a total of 59 rules in 17 ms. Remains 55 /80 variables (removed 25) and now considering 93/152 (removed 59) transitions.
[2022-05-16 09:56:13] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 55 cols
[2022-05-16 09:56:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:13] [INFO ] Implicit Places using invariants in 76 ms returned []
[2022-05-16 09:56:13] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 55 cols
[2022-05-16 09:56:13] [INFO ] Computed 9 place invariants in 11 ms
[2022-05-16 09:56:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:56:13] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2022-05-16 09:56:13] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 55 cols
[2022-05-16 09:56:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:13] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/80 places, 93/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/80 places, 93/152 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s31 1), p0:(AND (EQ s8 1) (EQ s53 1)), p2:(EQ s30 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-02 finished in 680 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(!G(p0) U G((G(p0) U p1)))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 92 edges and 80 vertex of which 8 / 80 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 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 57 transition count 113
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 57 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 57 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 53 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 53 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 53 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 52 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 52 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 51 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 51 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 51 transition count 93
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 58 place count 50 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 48 transition count 114
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 48 transition count 112
Applied a total of 64 rules in 76 ms. Remains 48 /80 variables (removed 32) and now considering 112/152 (removed 40) transitions.
[2022-05-16 09:56:13] [INFO ] Flow matrix only has 102 transitions (discarded 10 similar events)
// Phase 1: matrix 102 rows 48 cols
[2022-05-16 09:56:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:14] [INFO ] Implicit Places using invariants in 82 ms returned []
[2022-05-16 09:56:14] [INFO ] Flow matrix only has 102 transitions (discarded 10 similar events)
// Phase 1: matrix 102 rows 48 cols
[2022-05-16 09:56:14] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:14] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-16 09:56:14] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2022-05-16 09:56:14] [INFO ] Redundant transitions in 40 ms returned []
[2022-05-16 09:56:14] [INFO ] Flow matrix only has 102 transitions (discarded 10 similar events)
// Phase 1: matrix 102 rows 48 cols
[2022-05-16 09:56:14] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:14] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/80 places, 112/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/80 places, 112/152 transitions.
Stuttering acceptance computed with spot in 222 ms :[p1, p1, (AND (NOT p0) p1), (AND p0 p1)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s34 1), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3 reset in 460 ms.
Product exploration explored 100000 steps with 12 reset in 205 ms.
Computed a total of 10 stabilizing places and 25 stable transitions
Computed a total of 10 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 647 ms. Reduced automaton from 4 states, 11 edges and 2 AP to 4 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 210 ms :[p1, p1, (AND (NOT p0) p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 1030 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1831000 steps, run timeout after 3001 ms. (steps per millisecond=610 ) properties seen :{0=1, 1=1, 2=1, 3=1}
Probabilistic random walk after 1831000 steps, saw 218410 distinct states, run finished after 3002 ms. (steps per millisecond=609 ) properties seen :4
Running SMT prover for 1 properties.
[2022-05-16 09:56:19] [INFO ] Flow matrix only has 102 transitions (discarded 10 similar events)
// Phase 1: matrix 102 rows 48 cols
[2022-05-16 09:56:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:19] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 09:56:19] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:56:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-16 09:56:19] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:56:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-16 09:56:19] [INFO ] After 10ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 09:56:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2022-05-16 09:56:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-16 09:56:19] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-05-16 09:56:19] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 12 factoid took 647 ms. Reduced automaton from 4 states, 11 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[p1, p1]
Stuttering acceptance computed with spot in 89 ms :[p1, p1]
Support contains 1 out of 48 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 112/112 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2022-05-16 09:56:20] [INFO ] Flow matrix only has 102 transitions (discarded 10 similar events)
// Phase 1: matrix 102 rows 48 cols
[2022-05-16 09:56:20] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:56:20] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-05-16 09:56:20] [INFO ] Flow matrix only has 102 transitions (discarded 10 similar events)
// Phase 1: matrix 102 rows 48 cols
[2022-05-16 09:56:20] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 09:56:20] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-16 09:56:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2022-05-16 09:56:20] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-16 09:56:20] [INFO ] Flow matrix only has 102 transitions (discarded 10 similar events)
// Phase 1: matrix 102 rows 48 cols
[2022-05-16 09:56:20] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:20] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 112/112 transitions.
Computed a total of 10 stabilizing places and 25 stable transitions
Computed a total of 10 stabilizing places and 25 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 1044 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 399555 steps, run visited all 1 properties in 640 ms. (steps per millisecond=624 )
Probabilistic random walk after 399555 steps, saw 53931 distinct states, run finished after 640 ms. (steps per millisecond=624 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[p1, p1]
Stuttering acceptance computed with spot in 80 ms :[p1, p1]
Stuttering acceptance computed with spot in 96 ms :[p1, p1]
Product exploration explored 100000 steps with 8 reset in 68 ms.
Product exploration explored 100000 steps with 4 reset in 162 ms.
Built C files in :
/tmp/ltsmin10981566473804930124
[2022-05-16 09:56:22] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2022-05-16 09:56:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:56:22] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2022-05-16 09:56:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:56:22] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2022-05-16 09:56:22] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:56:22] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10981566473804930124
Running compilation step : cd /tmp/ltsmin10981566473804930124;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 838 ms.
Running link step : cd /tmp/ltsmin10981566473804930124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin10981566473804930124;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2949807546135318236.hoa' '--buchi-type=spotba'
LTSmin run took 518 ms.
FORMULA HealthRecord-PT-13-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-13-LTLFireability-04 finished in 10227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(p0 U p1))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 92 edges and 80 vertex of which 8 / 80 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.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 58 transition count 114
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 58 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 58 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 53 transition count 103
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 53 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 53 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 50 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 50 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 47 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 47 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 71 place count 47 transition count 77
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 73 place count 46 transition count 76
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 87 place count 39 transition count 111
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 39 transition count 109
Applied a total of 89 rules in 37 ms. Remains 39 /80 variables (removed 41) and now considering 109/152 (removed 43) transitions.
[2022-05-16 09:56:24] [INFO ] Flow matrix only has 91 transitions (discarded 18 similar events)
// Phase 1: matrix 91 rows 39 cols
[2022-05-16 09:56:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:24] [INFO ] Implicit Places using invariants in 111 ms returned []
[2022-05-16 09:56:24] [INFO ] Flow matrix only has 91 transitions (discarded 18 similar events)
// Phase 1: matrix 91 rows 39 cols
[2022-05-16 09:56:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 09:56:24] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2022-05-16 09:56:24] [INFO ] Redundant transitions in 34 ms returned []
[2022-05-16 09:56:24] [INFO ] Flow matrix only has 91 transitions (discarded 18 similar events)
// Phase 1: matrix 91 rows 39 cols
[2022-05-16 09:56:24] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:56:24] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/80 places, 109/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/80 places, 109/152 transitions.
Stuttering acceptance computed with spot in 108 ms :[p1, p1]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s26 1), p0:(OR (EQ s26 1) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 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 594 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p1))&&G((G(p2)||p3))&&p0)))'
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 61 transition count 116
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 61 transition count 116
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 56 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 56 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 56 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 54 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 54 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 52 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 52 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 52 transition count 87
Applied a total of 65 rules in 12 ms. Remains 52 /80 variables (removed 28) and now considering 87/152 (removed 65) transitions.
[2022-05-16 09:56:24] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2022-05-16 09:56:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:24] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-16 09:56:24] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2022-05-16 09:56:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:56:24] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2022-05-16 09:56:24] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2022-05-16 09:56:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:25] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/80 places, 87/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/80 places, 87/152 transitions.
Stuttering acceptance computed with spot in 869 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=0 dest: 2}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={0} source=0 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=1 dest: 4}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=1 dest: 6}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={0} source=1 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p3 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p3) p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p3 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p3 p2), acceptance={1} source=2 dest: 8}, { cond=(AND p0 p3 p2), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={1} source=3 dest: 2}, { cond=(OR p3 p2), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0, 1} source=4 dest: 0}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={0} source=4 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0, 1} source=5 dest: 4}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={1} source=5 dest: 6}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={0} source=5 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p3) p2 (NOT p1))), acceptance={1} source=6 dest: 2}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={1} source=6 dest: 8}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={1} source=7 dest: 2}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=7 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=8 dest: 4}, { cond=(AND p0 p3 (NOT p2)), acceptance={0, 1} source=8 dest: 5}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p3) p2)), acceptance={1} source=8 dest: 6}, { cond=(AND p0 p3 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 p3 p2), acceptance={1} source=8 dest: 10}, { cond=(AND p0 p3 p2), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={1} source=9 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={0} source=9 dest: 3}, { cond=(AND p3 p2), acceptance={} source=9 dest: 9}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0, 1} source=10 dest: 4}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0, 1} source=10 dest: 5}, { cond=(OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p3) p2 (NOT p1))), acceptance={1} source=10 dest: 6}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 7}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={1} source=10 dest: 10}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=11 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={1} source=11 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 3}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=11 dest: 9}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s10 1) (EQ s14 1) (EQ s17 1) (EQ s20 1) (EQ s23 1) (EQ s26 1) (EQ s29 1) (EQ s35 1) (EQ s51 1)), p3:(EQ s41 0), p2:(OR (EQ s22 0) (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 16 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 1285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(p0))&&p0))))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 61 transition count 115
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 61 transition count 115
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 56 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 56 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 56 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 53 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 53 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 50 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 50 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 72 place count 50 transition count 78
Applied a total of 72 rules in 6 ms. Remains 50 /80 variables (removed 30) and now considering 78/152 (removed 74) transitions.
[2022-05-16 09:56:25] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
// Phase 1: matrix 74 rows 50 cols
[2022-05-16 09:56:25] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:56:26] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-05-16 09:56:26] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
// Phase 1: matrix 74 rows 50 cols
[2022-05-16 09:56:26] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:56:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:56:26] [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.
[2022-05-16 09:56:26] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
// Phase 1: matrix 74 rows 50 cols
[2022-05-16 09:56:26] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:56:26] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/80 places, 78/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/80 places, 78/152 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p0:(EQ s14 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][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-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-08 finished in 530 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (p1 U p2)) U (X(p1)&&p3))||X(G(p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 62 transition count 118
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 62 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 57 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 57 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 57 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 54 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 52 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 52 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 52 transition count 86
Applied a total of 65 rules in 6 ms. Remains 52 /80 variables (removed 28) and now considering 86/152 (removed 66) transitions.
[2022-05-16 09:56:26] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 52 cols
[2022-05-16 09:56:26] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-05-16 09:56:26] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 52 cols
[2022-05-16 09:56:26] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:56:26] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-05-16 09:56:26] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 52 cols
[2022-05-16 09:56:26] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 09:56:26] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/80 places, 86/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/80 places, 86/152 transitions.
Stuttering acceptance computed with spot in 847 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) p3), (NOT p1), (OR (AND (NOT p1) (NOT p2) p3) (AND p0 (NOT p1) (NOT p2))), true, (NOT p2), (NOT p2), (OR (NOT p1) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=0 dest: 6}, { cond=(OR (AND p3 p2) (AND p3 p1) (AND p3 p0)), acceptance={} source=0 dest: 7}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 8}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 9}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=3 dest: 6}, { cond=(OR (AND p3 p2) (AND p3 p1) (AND p3 p0)), acceptance={} source=3 dest: 7}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 10}, { cond=(OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 9}], [{ cond=(NOT p1), acceptance={} source=5 dest: 9}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 10}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p3 p2 (NOT p1)) (AND p3 (NOT p1) p0)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 9}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0} source=7 dest: 10}, { cond=(OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) (NOT p1) p0)), acceptance={0} source=7 dest: 12}], [{ cond=(OR (AND p3 (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p1) p0)), acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=10 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={0} source=10 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=10 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={0} source=11 dest: 11}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=12 dest: 5}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=12 dest: 6}, { cond=(OR (AND p3 p2) (AND p3 p1) (AND p3 p0)), acceptance={0} source=12 dest: 7}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={0} source=12 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=12 dest: 9}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=12 dest: 10}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0} source=12 dest: 11}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p3:(AND (EQ s12 1) (EQ s50 1)), p2:(EQ s37 1), p1:(AND (EQ s12 1) (EQ s50 1)), p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-09 finished in 1211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U p1)||(!p2 U F(p3)))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 75 edges and 80 vertex of which 6 / 80 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 57 transition count 111
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 57 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 57 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 52 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 52 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 49 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 49 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 47 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 47 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 47 transition count 78
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 73 place count 46 transition count 77
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 85 place count 40 transition count 112
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 40 transition count 111
Applied a total of 86 rules in 34 ms. Remains 40 /80 variables (removed 40) and now considering 111/152 (removed 41) transitions.
[2022-05-16 09:56:27] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
// Phase 1: matrix 93 rows 40 cols
[2022-05-16 09:56:27] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-16 09:56:27] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
// Phase 1: matrix 93 rows 40 cols
[2022-05-16 09:56:27] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:56:27] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 09:56:27] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2022-05-16 09:56:28] [INFO ] Redundant transitions in 34 ms returned []
[2022-05-16 09:56:28] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
// Phase 1: matrix 93 rows 40 cols
[2022-05-16 09:56:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:28] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/80 places, 111/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/80 places, 111/152 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p3) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p3:(AND (EQ s24 1) (EQ s30 1)), p1:(AND (EQ s1 1) (EQ s38 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 1 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 504 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||p1)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 92 edges and 80 vertex of which 8 / 80 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 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 57 transition count 113
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 57 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 57 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 54 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 54 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 54 transition count 103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 52 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 52 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 50 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 50 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 61 place count 50 transition count 87
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 63 place count 49 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 47 transition count 105
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 47 transition count 103
Applied a total of 69 rules in 39 ms. Remains 47 /80 variables (removed 33) and now considering 103/152 (removed 49) transitions.
[2022-05-16 09:56:28] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
// Phase 1: matrix 94 rows 47 cols
[2022-05-16 09:56:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-05-16 09:56:28] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
// Phase 1: matrix 94 rows 47 cols
[2022-05-16 09:56:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:28] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 09:56:28] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-05-16 09:56:28] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-16 09:56:28] [INFO ] Flow matrix only has 94 transitions (discarded 9 similar events)
// Phase 1: matrix 94 rows 47 cols
[2022-05-16 09:56:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:28] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/80 places, 103/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/80 places, 103/152 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s26 1), p1:(EQ s27 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-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-12 finished in 454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!F(p0))) U (X(G(p0))||p1)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 62 transition count 118
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 62 transition count 118
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 58 transition count 110
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 58 transition count 110
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 55 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 53 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 53 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 53 transition count 91
Applied a total of 60 rules in 8 ms. Remains 53 /80 variables (removed 27) and now considering 91/152 (removed 61) transitions.
[2022-05-16 09:56:28] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2022-05-16 09:56:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:28] [INFO ] Implicit Places using invariants in 73 ms returned []
[2022-05-16 09:56:28] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2022-05-16 09:56:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:56:28] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2022-05-16 09:56:28] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2022-05-16 09:56:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:28] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/80 places, 91/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/80 places, 91/152 transitions.
Stuttering acceptance computed with spot in 140 ms :[false, (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s37 1), p1:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14 reset in 90 ms.
Product exploration explored 100000 steps with 1 reset in 172 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 (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 506 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[false, (AND (NOT p0) (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 777 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 3) 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 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 09:56:30] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2022-05-16 09:56:30] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:30] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-05-16 09:56:30] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-16 09:56:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:56:30] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:56:30] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:56:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 09:56:30] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 09:56:30] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 09:56:30] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-16 09:56:30] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 53/53 places, 91/91 transitions.
Graph (trivial) has 46 edges and 53 vertex of which 8 / 53 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 183 edges and 49 vertex of which 34 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 34 transition count 53
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 24 place count 34 transition count 46
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 38 place count 27 transition count 46
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 23 transition count 36
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 23 transition count 36
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 22 transition count 35
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 22 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 21 transition count 34
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 21 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 21 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 19 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 19 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 18 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 17 transition count 29
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 17 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 16 transition count 24
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 15 transition count 23
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 15 transition count 23
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 15 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 14 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 14 transition count 19
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 14 transition count 18
Applied a total of 73 rules in 15 ms. Remains 14 /53 variables (removed 39) and now considering 18/91 (removed 73) transitions.
Finished structural reductions, in 1 iterations. Remains : 14/53 places, 18/91 transitions.
Finished random walk after 35 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 589 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[false, (AND (NOT p0) (NOT p1)), p0]
Stuttering acceptance computed with spot in 145 ms :[false, (AND (NOT p0) (NOT p1)), p0]
[2022-05-16 09:56:31] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2022-05-16 09:56:31] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:31] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-16 09:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:56:31] [INFO ] [Real]Absence check using state equation in 45 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 9 factoid took 291 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA HealthRecord-PT-13-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-13-LTLFireability-13 finished in 3573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p0) U F(p1)))||p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 92 edges and 80 vertex of which 8 / 80 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 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 57 transition count 113
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 57 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 57 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 53 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 53 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 53 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 51 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 51 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 49 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 49 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 62 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 64 place count 48 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 46 transition count 104
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 46 transition count 102
Applied a total of 70 rules in 24 ms. Remains 46 /80 variables (removed 34) and now considering 102/152 (removed 50) transitions.
[2022-05-16 09:56:32] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
// Phase 1: matrix 93 rows 46 cols
[2022-05-16 09:56:32] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:56:32] [INFO ] Implicit Places using invariants in 91 ms returned []
[2022-05-16 09:56:32] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
// Phase 1: matrix 93 rows 46 cols
[2022-05-16 09:56:32] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 09:56:32] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2022-05-16 09:56:32] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-16 09:56:32] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
// Phase 1: matrix 93 rows 46 cols
[2022-05-16 09:56:32] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:56:32] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/80 places, 102/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/80 places, 102/152 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s27 1), p1:(EQ s5 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-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-14 finished in 524 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(p0)&&p0))))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 152/152 transitions.
Graph (trivial) has 95 edges and 80 vertex of which 8 / 80 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 56 transition count 110
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 56 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 56 transition count 109
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 51 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 51 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 51 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 48 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 48 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 45 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 45 transition count 81
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 74 place count 45 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 44 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 42 transition count 85
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 42 transition count 83
Applied a total of 82 rules in 19 ms. Remains 42 /80 variables (removed 38) and now considering 83/152 (removed 69) transitions.
[2022-05-16 09:56:32] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-05-16 09:56:32] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 09:56:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2022-05-16 09:56:32] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-05-16 09:56:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:56:32] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 09:56:32] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2022-05-16 09:56:33] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-16 09:56:33] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 42 cols
[2022-05-16 09:56:33] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 09:56:33] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/80 places, 83/152 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/80 places, 83/152 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLFireability-15 finished in 386 ms.
All properties solved by simple procedures.
Total runtime 30784 ms.

BK_STOP 1652694993302

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
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 r114-smll-165264477300172"
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 ;