Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 68K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716557610996

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 13:33:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:33:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:33:32] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-24 13:33:32] [INFO ] Transformed 157 places.
[2024-05-24 13:33:32] [INFO ] Transformed 327 transitions.
[2024-05-24 13:33:32] [INFO ] Found NUPN structural information;
[2024-05-24 13:33:32] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 91 transition count 177
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 91 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 133 place count 90 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 134 place count 90 transition count 175
Applied a total of 134 rules in 228 ms. Remains 90 /157 variables (removed 67) and now considering 175/301 (removed 126) transitions.
[2024-05-24 13:33:33] [INFO ] Flow matrix only has 171 transitions (discarded 4 similar events)
// Phase 1: matrix 171 rows 90 cols
[2024-05-24 13:33:33] [INFO ] Computed 10 invariants in 17 ms
[2024-05-24 13:33:33] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-24 13:33:33] [INFO ] Flow matrix only has 171 transitions (discarded 4 similar events)
[2024-05-24 13:33:33] [INFO ] Invariant cache hit.
[2024-05-24 13:33:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:33] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-24 13:33:33] [INFO ] Flow matrix only has 171 transitions (discarded 4 similar events)
[2024-05-24 13:33:33] [INFO ] Invariant cache hit.
[2024-05-24 13:33:33] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/157 places, 175/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 90/157 places, 175/301 transitions.
Support contains 32 out of 90 places after structural reductions.
[2024-05-24 13:33:33] [INFO ] Flatten gal took : 34 ms
[2024-05-24 13:33:33] [INFO ] Flatten gal took : 14 ms
[2024-05-24 13:33:33] [INFO ] Input system was already deterministic with 175 transitions.
Incomplete random walk after 10000 steps, including 597 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 31) seen :9
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2024-05-24 13:33:34] [INFO ] Flow matrix only has 171 transitions (discarded 4 similar events)
[2024-05-24 13:33:34] [INFO ] Invariant cache hit.
[2024-05-24 13:33:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 13:33:34] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:33:34] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:21
[2024-05-24 13:33:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:34] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:21
[2024-05-24 13:33:34] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:21
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-24 13:33:34] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:21
[2024-05-24 13:33:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-24 13:33:34] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-24 13:33:34] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2024-05-24 13:33:34] [INFO ] After 133ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2024-05-24 13:33:35] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 13:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-24 13:33:35] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-24 13:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-24 13:33:35] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 2 ms to minimize.
[2024-05-24 13:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-24 13:33:35] [INFO ] After 539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 136 ms.
[2024-05-24 13:33:35] [INFO ] After 1002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Fused 22 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 22 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 175/175 transitions.
Graph (trivial) has 73 edges and 90 vertex of which 10 / 90 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 348 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 158
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 82 transition count 157
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 82 transition count 154
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 77 transition count 154
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 21 place count 71 transition count 142
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 71 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 69 transition count 138
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 69 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 67 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 67 transition count 135
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 62 transition count 173
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 62 transition count 173
Applied a total of 47 rules in 35 ms. Remains 62 /90 variables (removed 28) and now considering 173/175 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 62/90 places, 173/175 transitions.
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 22) seen :8
Incomplete Best-First random walk after 10001 steps, including 429 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 452 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 413 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 436 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-24 13:33:36] [INFO ] Flow matrix only has 165 transitions (discarded 8 similar events)
// Phase 1: matrix 165 rows 62 cols
[2024-05-24 13:33:36] [INFO ] Computed 7 invariants in 7 ms
[2024-05-24 13:33:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 13:33:36] [INFO ] [Real]Absence check using 1 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 13:33:36] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-24 13:33:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 13:33:36] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-24 13:33:36] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-24 13:33:36] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 13:33:36] [INFO ] After 50ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-24 13:33:36] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-24 13:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-24 13:33:36] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-24 13:33:36] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-24 13:33:36] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-24 13:33:36] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-24 13:33:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 168 ms
[2024-05-24 13:33:36] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-24 13:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-24 13:33:36] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-24 13:33:36] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 11 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 173/173 transitions.
Graph (trivial) has 45 edges and 62 vertex of which 2 / 62 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 286 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 60 transition count 170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 59 transition count 169
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 10 place count 54 transition count 159
Iterating global reduction 2 with 5 rules applied. Total rules applied 15 place count 54 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 53 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 53 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 53 transition count 156
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 3 with 2 rules applied. Total rules applied 20 place count 52 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 51 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 51 transition count 152
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 27 place count 51 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 31 place count 49 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 35 place count 49 transition count 144
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 55 place count 49 transition count 144
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 56 place count 49 transition count 144
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 57 place count 48 transition count 142
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 48 transition count 142
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 47 transition count 139
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 47 transition count 139
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 65 place count 47 transition count 134
Applied a total of 65 rules in 35 ms. Remains 47 /62 variables (removed 15) and now considering 134/173 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 47/62 places, 134/173 transitions.
Incomplete random walk after 10000 steps, including 1738 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 373 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 361 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 379 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 375 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 377 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 397 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 295 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 406 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 370 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 386 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Finished probabilistic random walk after 6614 steps, run visited all 10 properties in 62 ms. (steps per millisecond=106 )
Probabilistic random walk after 6614 steps, saw 2028 distinct states, run finished after 62 ms. (steps per millisecond=106 ) properties seen :10
Parikh walk visited 0 properties in 0 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 65 transition count 126
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 65 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 58 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 58 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 73 place count 58 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 55 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 55 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 52 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 52 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 94 place count 52 transition count 79
Applied a total of 94 rules in 7 ms. Remains 52 /90 variables (removed 38) and now considering 79/175 (removed 96) transitions.
[2024-05-24 13:33:37] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 52 cols
[2024-05-24 13:33:37] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:33:37] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 13:33:37] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 13:33:37] [INFO ] Invariant cache hit.
[2024-05-24 13:33:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-24 13:33:37] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 13:33:37] [INFO ] Invariant cache hit.
[2024-05-24 13:33:37] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/90 places, 79/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 52/90 places, 79/175 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), 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}]], initial=2, aps=[p1:(EQ s20 1), p0:(EQ s48 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-00 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U (p0&&G(p1)))||X(p2)))))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 66 transition count 128
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 66 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 59 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 59 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 68 place count 59 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 56 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 56 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 54 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 54 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 84 place count 54 transition count 89
Applied a total of 84 rules in 14 ms. Remains 54 /90 variables (removed 36) and now considering 89/175 (removed 86) transitions.
[2024-05-24 13:33:38] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 54 cols
[2024-05-24 13:33:38] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:33:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 13:33:38] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 13:33:38] [INFO ] Invariant cache hit.
[2024-05-24 13:33:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:38] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-24 13:33:38] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 13:33:38] [INFO ] Invariant cache hit.
[2024-05-24 13:33:38] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/90 places, 89/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 54/90 places, 89/175 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), false, false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 p0 p2), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 p0 p2), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=5 dest: 6}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=7 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s32 1), p1:(EQ s11 1), p2:(EQ s30 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33361 reset in 282 ms.
Product exploration explored 100000 steps with 33397 reset in 201 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) p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 347 ms. Reduced automaton from 8 states, 48 edges and 3 AP (stutter sensitive) to 8 states, 48 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), false, false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 594 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :7
Running SMT prover for 7 properties.
[2024-05-24 13:33:40] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 13:33:40] [INFO ] Invariant cache hit.
[2024-05-24 13:33:40] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:33:40] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:4
[2024-05-24 13:33:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:40] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 13:33:40] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 13:33:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-24 13:33:40] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-24 13:33:40] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2024-05-24 13:33:40] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-24 13:33:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-24 13:33:40] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-24 13:33:40] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 89/89 transitions.
Graph (trivial) has 48 edges and 54 vertex of which 12 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 175 edges and 48 vertex of which 31 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 31 transition count 47
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 22 place count 31 transition count 43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 30 place count 27 transition count 43
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 25 transition count 39
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 25 transition count 39
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 24 transition count 38
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 24 transition count 38
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 23 transition count 37
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 23 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 23 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 20 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 20 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 19 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 18 transition count 31
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 18 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 17 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 16 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 16 transition count 25
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 16 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 15 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 15 transition count 21
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 15 transition count 20
Applied a total of 63 rules in 19 ms. Remains 15 /54 variables (removed 39) and now considering 20/89 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 15/54 places, 20/89 transitions.
Finished random walk after 103 steps, including 13 resets, run visited all 5 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND p0 (NOT p2) p1))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p2) p1)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) p2 p1)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F p1), (F (AND p0 (NOT p1))), (F (AND p0 p2 p1)), (F (AND p0 p2 (NOT p1)))]
Knowledge based reduction with 29 factoid took 2140 ms. Reduced automaton from 8 states, 48 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 89/89 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-05-24 13:33:43] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 13:33:43] [INFO ] Invariant cache hit.
[2024-05-24 13:33:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 13:33:43] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 13:33:43] [INFO ] Invariant cache hit.
[2024-05-24 13:33:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:43] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-24 13:33:43] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 13:33:43] [INFO ] Invariant cache hit.
[2024-05-24 13:33:43] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 54/54 places, 89/89 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) p1))), (X (X (OR (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 108 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 571 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Finished probabilistic random walk after 326 steps, run visited all 7 properties in 12 ms. (steps per millisecond=27 )
Probabilistic random walk after 326 steps, saw 213 distinct states, run finished after 12 ms. (steps per millisecond=27 ) properties seen :7
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) p1))), (X (X (OR (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 12 factoid took 347 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 33370 reset in 151 ms.
Product exploration explored 100000 steps with 33298 reset in 133 ms.
Built C files in :
/tmp/ltsmin8762217554322914318
[2024-05-24 13:33:45] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8762217554322914318
Running compilation step : cd /tmp/ltsmin8762217554322914318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin8762217554322914318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8762217554322914318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12493936813475783447.hoa' '--buchi-type=spotba'
LTSmin run took 87 ms.
FORMULA HealthRecord-PT-09-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-09-LTLFireability-01 finished in 7593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Graph (trivial) has 111 edges and 90 vertex of which 12 / 90 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 59 transition count 121
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 59 transition count 121
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 56 place count 52 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 63 place count 52 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 72 place count 52 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 50 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 50 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 48 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 48 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 86 place count 48 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 47 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 47 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 45 transition count 99
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 45 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 44 transition count 95
Applied a total of 97 rules in 28 ms. Remains 44 /90 variables (removed 46) and now considering 95/175 (removed 80) transitions.
[2024-05-24 13:33:45] [INFO ] Flow matrix only has 84 transitions (discarded 11 similar events)
// Phase 1: matrix 84 rows 44 cols
[2024-05-24 13:33:45] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 13:33:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 13:33:45] [INFO ] Flow matrix only has 84 transitions (discarded 11 similar events)
[2024-05-24 13:33:45] [INFO ] Invariant cache hit.
[2024-05-24 13:33:45] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 13:33:45] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-24 13:33:46] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 84 transitions (discarded 11 similar events)
[2024-05-24 13:33:46] [INFO ] Invariant cache hit.
[2024-05-24 13:33:46] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/90 places, 95/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 44/90 places, 95/175 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s9 1), p1:(EQ s32 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-02 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p0)))))'
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 64 transition count 124
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 64 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 57 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 57 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 72 place count 57 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 54 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 54 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 51 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 51 transition count 89
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 93 place count 51 transition count 80
Applied a total of 93 rules in 7 ms. Remains 51 /90 variables (removed 39) and now considering 80/175 (removed 95) transitions.
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 51 cols
[2024-05-24 13:33:46] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 13:33:46] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 13:33:46] [INFO ] Invariant cache hit.
[2024-05-24 13:33:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:46] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 13:33:46] [INFO ] Invariant cache hit.
[2024-05-24 13:33:46] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/90 places, 80/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 51/90 places, 80/175 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-03 finished in 208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 64 transition count 124
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 64 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 57 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 57 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 72 place count 57 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 54 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 54 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 51 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 51 transition count 89
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 93 place count 51 transition count 80
Applied a total of 93 rules in 7 ms. Remains 51 /90 variables (removed 39) and now considering 80/175 (removed 95) transitions.
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 51 cols
[2024-05-24 13:33:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:33:46] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 13:33:46] [INFO ] Invariant cache hit.
[2024-05-24 13:33:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 13:33:46] [INFO ] Invariant cache hit.
[2024-05-24 13:33:46] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/90 places, 80/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 51/90 places, 80/175 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-04 finished in 218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Graph (trivial) has 93 edges and 90 vertex of which 12 / 90 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 58 transition count 119
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 58 transition count 119
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 59 place count 50 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 67 place count 50 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 76 place count 50 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 47 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 47 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 44 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 44 transition count 79
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 96 place count 44 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 43 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 43 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 41 transition count 83
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 41 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 40 transition count 79
Applied a total of 107 rules in 25 ms. Remains 40 /90 variables (removed 50) and now considering 79/175 (removed 96) transitions.
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
// Phase 1: matrix 69 rows 40 cols
[2024-05-24 13:33:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:33:46] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-05-24 13:33:46] [INFO ] Invariant cache hit.
[2024-05-24 13:33:46] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-24 13:33:46] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-24 13:33:46] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-05-24 13:33:46] [INFO ] Invariant cache hit.
[2024-05-24 13:33:46] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/90 places, 79/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 40/90 places, 79/175 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5 1) (OR (EQ s10 0) (EQ s38 0)))], 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-09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-05 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(p0 U G(!p0)))))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 65 transition count 126
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 65 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 58 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 58 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 73 place count 58 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 56 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 56 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 54 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 54 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 87 place count 54 transition count 87
Applied a total of 87 rules in 6 ms. Remains 54 /90 variables (removed 36) and now considering 87/175 (removed 88) transitions.
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 54 cols
[2024-05-24 13:33:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:33:46] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-05-24 13:33:46] [INFO ] Invariant cache hit.
[2024-05-24 13:33:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-24 13:33:46] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-05-24 13:33:46] [INFO ] Invariant cache hit.
[2024-05-24 13:33:47] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/90 places, 87/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 54/90 places, 87/175 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, true, true, (NOT p1), p0, p0]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s39 1), p1:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-07 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Graph (trivial) has 113 edges and 90 vertex of which 12 / 90 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 58 transition count 119
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 58 transition count 119
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 59 place count 50 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 67 place count 50 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 75 place count 50 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 47 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 47 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 44 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 44 transition count 80
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 96 place count 44 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 43 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 43 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 41 transition count 83
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 41 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 40 transition count 79
Applied a total of 107 rules in 22 ms. Remains 40 /90 variables (removed 50) and now considering 79/175 (removed 96) transitions.
[2024-05-24 13:33:47] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
// Phase 1: matrix 69 rows 40 cols
[2024-05-24 13:33:47] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:33:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 13:33:47] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-05-24 13:33:47] [INFO ] Invariant cache hit.
[2024-05-24 13:33:47] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-24 13:33:47] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-24 13:33:47] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 13:33:47] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
[2024-05-24 13:33:47] [INFO ] Invariant cache hit.
[2024-05-24 13:33:47] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/90 places, 79/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 40/90 places, 79/175 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 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 1 ms.
FORMULA HealthRecord-PT-09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-08 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||((p2&&G(p3)) U !p2))))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 65 transition count 126
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 65 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 58 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 58 transition count 112
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 72 place count 58 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 56 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 54 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 54 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 86 place count 54 transition count 88
Applied a total of 86 rules in 9 ms. Remains 54 /90 variables (removed 36) and now considering 88/175 (removed 87) transitions.
[2024-05-24 13:33:47] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 54 cols
[2024-05-24 13:33:47] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:33:47] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 13:33:47] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 13:33:47] [INFO ] Invariant cache hit.
[2024-05-24 13:33:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:47] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-24 13:33:47] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 13:33:47] [INFO ] Invariant cache hit.
[2024-05-24 13:33:47] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/90 places, 88/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 54/90 places, 88/175 transitions.
Stuttering acceptance computed with spot in 302 ms :[true, (OR (NOT p3) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p1), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2 p3), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=7 dest: 5}, { cond=(AND p1 p3), acceptance={} source=7 dest: 7}]], initial=2, aps=[p3:(EQ s12 1), p2:(NEQ s25 1), p0:(EQ s40 1), p1:(EQ s12 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 82 ms.
Product exploration explored 100000 steps with 4 reset in 80 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 p3) p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (AND (NOT p0) p1 p2 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 p2 p3))), true, (X (X (NOT p3))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 95 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p1)]
Finished random walk after 4933 steps, including 293 resets, run visited all 1 properties in 10 ms. (steps per millisecond=493 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (AND (NOT p0) p1 p2 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 p2 p3))), true, (X (X (NOT p3))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 16 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-09-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-09-LTLFireability-09 finished in 936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(F(((X(p1)&&F(!p2))||G(p1))))))))))'
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 66 transition count 128
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 66 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 59 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 59 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 70 place count 59 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 58 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 58 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 57 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 57 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 57 transition count 98
Applied a total of 77 rules in 7 ms. Remains 57 /90 variables (removed 33) and now considering 98/175 (removed 77) transitions.
[2024-05-24 13:33:48] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
// Phase 1: matrix 95 rows 57 cols
[2024-05-24 13:33:48] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:33:48] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 13:33:48] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2024-05-24 13:33:48] [INFO ] Invariant cache hit.
[2024-05-24 13:33:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:48] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 13:33:48] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2024-05-24 13:33:48] [INFO ] Invariant cache hit.
[2024-05-24 13:33:48] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/90 places, 98/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 57/90 places, 98/175 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s41 1), p1:(NEQ s4 1), p2:(AND (EQ s35 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-11 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)||X(p2)) U X(p3)))'
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 66 transition count 128
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 66 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 60 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 60 transition count 116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 66 place count 60 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 57 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 57 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 54 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 54 transition count 95
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 54 transition count 86
Applied a total of 87 rules in 9 ms. Remains 54 /90 variables (removed 36) and now considering 86/175 (removed 89) transitions.
[2024-05-24 13:33:48] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 54 cols
[2024-05-24 13:33:48] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:33:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 13:33:49] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 13:33:49] [INFO ] Invariant cache hit.
[2024-05-24 13:33:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:33:49] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-24 13:33:49] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 13:33:49] [INFO ] Invariant cache hit.
[2024-05-24 13:33:49] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/90 places, 86/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 54/90 places, 86/175 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s32 1), p1:(AND (EQ s24 1) (EQ s52 1)), p2:(NEQ s43 1), p3:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1205 steps with 399 reset in 6 ms.
FORMULA HealthRecord-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-12 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(p1 U (p2||G(p1))))))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Graph (trivial) has 109 edges and 90 vertex of which 12 / 90 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 60 transition count 123
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 60 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 54 place count 53 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 61 place count 53 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 70 place count 53 transition count 100
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 72 place count 52 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 52 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 51 transition count 108
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 51 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 50 transition count 105
Applied a total of 78 rules in 16 ms. Remains 50 /90 variables (removed 40) and now considering 105/175 (removed 70) transitions.
[2024-05-24 13:33:49] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
// Phase 1: matrix 97 rows 50 cols
[2024-05-24 13:33:49] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:33:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 13:33:49] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2024-05-24 13:33:49] [INFO ] Invariant cache hit.
[2024-05-24 13:33:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-24 13:33:49] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 13:33:49] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 13:33:49] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2024-05-24 13:33:49] [INFO ] Invariant cache hit.
[2024-05-24 13:33:49] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/90 places, 105/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 50/90 places, 105/175 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (NEQ s2 1) (NEQ s7 1)), p1:(NEQ s7 1), p0:(EQ s27 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3 reset in 84 ms.
Product exploration explored 100000 steps with 8 reset in 107 ms.
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND p0 p1) p2)), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND p0 p1) p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 181 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1028 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Probably explored full state space saw : 236740 states, properties seen :6
Probabilistic random walk after 2104428 steps, saw 236740 distinct states, run finished after 2805 ms. (steps per millisecond=750 ) properties seen :6
Explored full state space saw : 236740 states, properties seen :0
Exhaustive walk after 2104428 steps, saw 236740 distinct states, run finished after 2335 ms. (steps per millisecond=901 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND p0 p1) p2)), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND p0 p1) p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (NOT (OR (AND p0 p1) p2))), (F (AND (NOT p2) (NOT p1))), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (NOT p0))]
Knowledge based reduction with 20 factoid took 459 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 105/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-05-24 13:33:56] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2024-05-24 13:33:56] [INFO ] Invariant cache hit.
[2024-05-24 13:33:56] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 13:33:56] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2024-05-24 13:33:56] [INFO ] Invariant cache hit.
[2024-05-24 13:33:56] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-24 13:33:56] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-24 13:33:56] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 13:33:56] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2024-05-24 13:33:56] [INFO ] Invariant cache hit.
[2024-05-24 13:33:56] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 50/50 places, 105/105 transitions.
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (OR p2 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X (OR p2 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 96 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1022 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 154 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Probably explored full state space saw : 236740 states, properties seen :3
Probabilistic random walk after 2104428 steps, saw 236740 distinct states, run finished after 1754 ms. (steps per millisecond=1199 ) properties seen :3
Explored full state space saw : 236740 states, properties seen :0
Exhaustive walk after 2104428 steps, saw 236740 distinct states, run finished after 1195 ms. (steps per millisecond=1761 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (OR p2 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X (OR p2 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 11 factoid took 204 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 18 reset in 77 ms.
Product exploration explored 100000 steps with 2 reset in 58 ms.
Built C files in :
/tmp/ltsmin13715342884219367235
[2024-05-24 13:34:00] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2024-05-24 13:34:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:34:00] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2024-05-24 13:34:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:34:00] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2024-05-24 13:34:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:34:00] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13715342884219367235
Running compilation step : cd /tmp/ltsmin13715342884219367235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 211 ms.
Running link step : cd /tmp/ltsmin13715342884219367235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13715342884219367235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2384959735845868106.hoa' '--buchi-type=spotba'
LTSmin run took 139 ms.
FORMULA HealthRecord-PT-09-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-09-LTLFireability-13 finished in 11618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 65 transition count 125
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 65 transition count 125
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 57 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 57 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 75 place count 57 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 54 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 54 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 51 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 51 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 95 place count 51 transition count 77
Applied a total of 95 rules in 4 ms. Remains 51 /90 variables (removed 39) and now considering 77/175 (removed 98) transitions.
[2024-05-24 13:34:00] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
// Phase 1: matrix 73 rows 51 cols
[2024-05-24 13:34:00] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 13:34:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 13:34:01] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
[2024-05-24 13:34:01] [INFO ] Invariant cache hit.
[2024-05-24 13:34:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:34:01] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-24 13:34:01] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
[2024-05-24 13:34:01] [INFO ] Invariant cache hit.
[2024-05-24 13:34:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/90 places, 77/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 51/90 places, 77/175 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s37 1) (NEQ s12 1)), p0:(NEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 135 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-09-LTLFireability-14 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||G(p0)))&&(G(p2)||G(!p0))))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 175/175 transitions.
Graph (trivial) has 111 edges and 90 vertex of which 12 / 90 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 59 transition count 121
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 59 transition count 121
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 57 place count 51 transition count 105
Iterating global reduction 0 with 8 rules applied. Total rules applied 65 place count 51 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 74 place count 51 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 48 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 48 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 45 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 45 transition count 81
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 95 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 2 with 2 rules applied. Total rules applied 97 place count 44 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 44 transition count 70
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 102 place count 42 transition count 84
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 42 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 41 transition count 80
Applied a total of 106 rules in 20 ms. Remains 41 /90 variables (removed 49) and now considering 80/175 (removed 95) transitions.
[2024-05-24 13:34:01] [INFO ] Flow matrix only has 70 transitions (discarded 10 similar events)
// Phase 1: matrix 70 rows 41 cols
[2024-05-24 13:34:01] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:34:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 13:34:01] [INFO ] Flow matrix only has 70 transitions (discarded 10 similar events)
[2024-05-24 13:34:01] [INFO ] Invariant cache hit.
[2024-05-24 13:34:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-24 13:34:01] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-24 13:34:01] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 13:34:01] [INFO ] Flow matrix only has 70 transitions (discarded 10 similar events)
[2024-05-24 13:34:01] [INFO ] Invariant cache hit.
[2024-05-24 13:34:01] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/90 places, 80/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 41/90 places, 80/175 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND p0 (NOT p2))), p0, (AND p0 (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p2) (AND (NOT p0) (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(EQ s25 0), p0:(NEQ s17 1), p1:(AND (NEQ s25 1) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 42 ms.
Product exploration explored 100000 steps with 2 reset in 40 ms.
Computed a total of 16 stabilizing places and 28 stable transitions
Computed a total of 16 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (OR (NOT p2) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p2 p0 (NOT p1)))), (X p0), (X (NOT (AND p2 (NOT p0)))), true, (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (OR (NOT p2) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 190 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p2)]
Finished random walk after 2163 steps, including 226 resets, run visited all 1 properties in 6 ms. (steps per millisecond=360 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (OR (NOT p2) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p2 p0 (NOT p1)))), (X p0), (X (NOT (AND p2 (NOT p0)))), true, (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (OR (NOT p2) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 20 factoid took 236 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-09-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-09-LTLFireability-15 finished in 965 ms.
All properties solved by simple procedures.
Total runtime 30010 ms.

BK_STOP 1716557643374

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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