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-171640625800508.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-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625800508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20: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 73K 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-15-LTLFireability-00
FORMULA_NAME HealthRecord-PT-15-LTLFireability-01
FORMULA_NAME HealthRecord-PT-15-LTLFireability-02
FORMULA_NAME HealthRecord-PT-15-LTLFireability-03
FORMULA_NAME HealthRecord-PT-15-LTLFireability-04
FORMULA_NAME HealthRecord-PT-15-LTLFireability-05
FORMULA_NAME HealthRecord-PT-15-LTLFireability-06
FORMULA_NAME HealthRecord-PT-15-LTLFireability-07
FORMULA_NAME HealthRecord-PT-15-LTLFireability-08
FORMULA_NAME HealthRecord-PT-15-LTLFireability-09
FORMULA_NAME HealthRecord-PT-15-LTLFireability-10
FORMULA_NAME HealthRecord-PT-15-LTLFireability-11
FORMULA_NAME HealthRecord-PT-15-LTLFireability-12
FORMULA_NAME HealthRecord-PT-15-LTLFireability-13
FORMULA_NAME HealthRecord-PT-15-LTLFireability-14
FORMULA_NAME HealthRecord-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716558454779

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-15
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 13:47:36] [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:47:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:47:36] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-24 13:47:36] [INFO ] Transformed 163 places.
[2024-05-24 13:47:36] [INFO ] Transformed 348 transitions.
[2024-05-24 13:47:36] [INFO ] Found NUPN structural information;
[2024-05-24 13:47:36] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
FORMULA HealthRecord-PT-15-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 319/319 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 86 transition count 174
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 86 transition count 174
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 159 place count 81 transition count 164
Iterating global reduction 0 with 5 rules applied. Total rules applied 164 place count 81 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 80 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 80 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 167 place count 79 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 168 place count 79 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 171 place count 79 transition count 156
Applied a total of 171 rules in 26 ms. Remains 79 /163 variables (removed 84) and now considering 156/319 (removed 163) transitions.
[2024-05-24 13:47:36] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
// Phase 1: matrix 153 rows 79 cols
[2024-05-24 13:47:36] [INFO ] Computed 9 invariants in 16 ms
[2024-05-24 13:47:36] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-24 13:47:36] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2024-05-24 13:47:36] [INFO ] Invariant cache hit.
[2024-05-24 13:47:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-24 13:47:36] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2024-05-24 13:47:36] [INFO ] Invariant cache hit.
[2024-05-24 13:47:36] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/163 places, 156/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 79/163 places, 156/319 transitions.
Support contains 30 out of 79 places after structural reductions.
[2024-05-24 13:47:37] [INFO ] Flatten gal took : 31 ms
[2024-05-24 13:47:37] [INFO ] Flatten gal took : 13 ms
[2024-05-24 13:47:37] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 29 out of 79 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 919 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 30) seen :16
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 112 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-24 13:47:38] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2024-05-24 13:47:38] [INFO ] Invariant cache hit.
[2024-05-24 13:47:38] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-24 13:47:38] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:12
[2024-05-24 13:47:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:38] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:13
[2024-05-24 13:47:38] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 5 ms to minimize.
[2024-05-24 13:47:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-24 13:47:38] [INFO ] After 90ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-24 13:47:38] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-24 13:47:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-24 13:47:38] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2024-05-24 13:47:39] [INFO ] After 80ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :12
[2024-05-24 13:47:39] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 13:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-24 13:47:39] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-24 13:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-24 13:47:39] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
[2024-05-24 13:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-24 13:47:39] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-24 13:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-24 13:47:39] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-24 13:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-24 13:47:39] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-24 13:47:39] [INFO ] After 691ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 11 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 156/156 transitions.
Graph (trivial) has 69 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 304 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 75 transition count 143
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 72 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 71 transition count 140
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 24 place count 59 transition count 116
Iterating global reduction 3 with 12 rules applied. Total rules applied 36 place count 59 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 38 place count 57 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 57 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 43 place count 57 transition count 109
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 55 place count 51 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 57 place count 51 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 59 place count 49 transition count 149
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 76 place count 49 transition count 149
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 91 place count 49 transition count 149
Applied a total of 91 rules in 52 ms. Remains 49 /79 variables (removed 30) and now considering 149/156 (removed 7) transitions.
[2024-05-24 13:47:39] [INFO ] Flow matrix only has 131 transitions (discarded 18 similar events)
// Phase 1: matrix 131 rows 49 cols
[2024-05-24 13:47:39] [INFO ] Computed 8 invariants in 5 ms
[2024-05-24 13:47:39] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 49/79 places, 149/156 transitions.
Incomplete random walk after 10000 steps, including 760 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 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 148 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 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 130 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-24 13:47:40] [INFO ] Flow matrix only has 131 transitions (discarded 18 similar events)
[2024-05-24 13:47:40] [INFO ] Invariant cache hit.
[2024-05-24 13:47:40] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:47:40] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 13:47:40] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:47:40] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 13:47:40] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-24 13:47:40] [INFO ] After 36ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-24 13:47:40] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 13:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-24 13:47:40] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-24 13:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-24 13:47:40] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-24 13:47:40] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 149/149 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 145
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 46 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 46 transition count 143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 11 place count 46 transition count 138
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 1 with 2 rules applied. Total rules applied 13 place count 45 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 43 transition count 137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 42 transition count 131
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 42 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 41 transition count 129
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 41 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 26 place count 41 transition count 124
Applied a total of 26 rules in 28 ms. Remains 41 /49 variables (removed 8) and now considering 124/149 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 41/49 places, 124/149 transitions.
Incomplete random walk after 10000 steps, including 806 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 139 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 141 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 104 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 156 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 150 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 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 140 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Finished probabilistic random walk after 3216 steps, run visited all 7 properties in 21 ms. (steps per millisecond=153 )
Probabilistic random walk after 3216 steps, saw 1052 distinct states, run finished after 21 ms. (steps per millisecond=153 ) properties seen :7
Parikh walk visited 0 properties in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA HealthRecord-PT-15-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((F(p0)||(F(G(p1))&&G(p2))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Graph (trivial) has 83 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 55 transition count 112
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 55 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 55 transition count 111
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 49 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 49 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 62 place count 49 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 47 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 47 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 47 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 46 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 46 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 46 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 45 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 43 transition count 90
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 43 transition count 88
Applied a total of 82 rules in 19 ms. Remains 43 /79 variables (removed 36) and now considering 88/156 (removed 68) transitions.
[2024-05-24 13:47:41] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
// Phase 1: matrix 81 rows 43 cols
[2024-05-24 13:47:41] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:47:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 13:47:41] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-24 13:47:41] [INFO ] Invariant cache hit.
[2024-05-24 13:47:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 13:47:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 13:47:41] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 13:47:41] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2024-05-24 13:47:41] [INFO ] Invariant cache hit.
[2024-05-24 13:47:41] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/79 places, 88/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 43/79 places, 88/156 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 260 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s41 1)), p2:(EQ s8 1), p1:(OR (EQ s13 0) (EQ s41 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 3 ms.
FORMULA HealthRecord-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-01 finished in 491 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||G(p1)))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Graph (trivial) has 92 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 56 transition count 114
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 56 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 56 transition count 113
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 50 transition count 100
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 50 transition count 100
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 49 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 49 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 49 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 48 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 46 transition count 102
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 46 transition count 100
Applied a total of 74 rules in 21 ms. Remains 46 /79 variables (removed 33) and now considering 100/156 (removed 56) transitions.
[2024-05-24 13:47:41] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
// Phase 1: matrix 92 rows 46 cols
[2024-05-24 13:47:41] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 13:47:41] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 13:47:41] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2024-05-24 13:47:41] [INFO ] Invariant cache hit.
[2024-05-24 13:47:41] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 13:47:41] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-24 13:47:41] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-24 13:47:41] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2024-05-24 13:47:41] [INFO ] Invariant cache hit.
[2024-05-24 13:47:41] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/79 places, 100/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 46/79 places, 100/156 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s13 0), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26 reset in 146 ms.
Product exploration explored 100000 steps with 1 reset in 86 ms.
Computed a total of 8 stabilizing places and 21 stable transitions
Computed a total of 8 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 276 steps, including 27 resets, run visited all 2 properties in 17 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 100/100 transitions.
Applied a total of 0 rules in 16 ms. Remains 46 /46 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-24 13:47:42] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2024-05-24 13:47:42] [INFO ] Invariant cache hit.
[2024-05-24 13:47:42] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 13:47:42] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2024-05-24 13:47:42] [INFO ] Invariant cache hit.
[2024-05-24 13:47:42] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 13:47:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-24 13:47:42] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 13:47:42] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2024-05-24 13:47:42] [INFO ] Invariant cache hit.
[2024-05-24 13:47:42] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 46/46 places, 100/100 transitions.
Computed a total of 8 stabilizing places and 21 stable transitions
Computed a total of 8 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 385 steps, including 41 resets, run visited all 2 properties in 9 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 92 ms.
Product exploration explored 100000 steps with 5 reset in 91 ms.
Built C files in :
/tmp/ltsmin16421276390654543733
[2024-05-24 13:47:43] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-24 13:47:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:47:43] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-24 13:47:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:47:43] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-24 13:47:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:47:43] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16421276390654543733
Running compilation step : cd /tmp/ltsmin16421276390654543733;'/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 404 ms.
Running link step : cd /tmp/ltsmin16421276390654543733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16421276390654543733;'/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/stateBased3038887928653513829.hoa' '--buchi-type=spotba'
LTSmin run took 121 ms.
FORMULA HealthRecord-PT-15-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-15-LTLFireability-02 finished in 2678 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)&&F(G(p1)))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Graph (trivial) has 83 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 55 transition count 112
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 55 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 55 transition count 111
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 49 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 49 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 63 place count 49 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 47 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 47 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 46 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 46 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 46 transition count 76
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 4 with 2 rules applied. Total rules applied 77 place count 45 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 43 transition count 89
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 43 transition count 87
Applied a total of 83 rules in 21 ms. Remains 43 /79 variables (removed 36) and now considering 87/156 (removed 69) transitions.
[2024-05-24 13:47:44] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
// Phase 1: matrix 80 rows 43 cols
[2024-05-24 13:47:44] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 13:47:44] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 13:47:44] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2024-05-24 13:47:44] [INFO ] Invariant cache hit.
[2024-05-24 13:47:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 13:47:44] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 13:47:44] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 13:47:44] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2024-05-24 13:47:44] [INFO ] Invariant cache hit.
[2024-05-24 13:47:44] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/79 places, 87/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 43/79 places, 87/156 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s41 1)), p1:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-03 finished in 325 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(F(p0))&&G(p1))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 61 transition count 120
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 61 transition count 120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 58 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 58 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 48 place count 58 transition count 108
Applied a total of 48 rules in 4 ms. Remains 58 /79 variables (removed 21) and now considering 108/156 (removed 48) transitions.
[2024-05-24 13:47:44] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
// Phase 1: matrix 105 rows 58 cols
[2024-05-24 13:47:44] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:47:44] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 13:47:44] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
[2024-05-24 13:47:44] [INFO ] Invariant cache hit.
[2024-05-24 13:47:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:44] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-24 13:47:44] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
[2024-05-24 13:47:44] [INFO ] Invariant cache hit.
[2024-05-24 13:47:44] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/79 places, 108/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 58/79 places, 108/156 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s30 1), p0:(OR (AND (EQ s45 0) (EQ s12 1)) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-04 finished in 341 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)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Graph (trivial) has 94 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 55 transition count 112
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 55 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 55 transition count 111
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 49 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 49 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 63 place count 49 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 48 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 48 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 47 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 47 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 46 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 44 transition count 96
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 44 transition count 94
Applied a total of 78 rules in 19 ms. Remains 44 /79 variables (removed 35) and now considering 94/156 (removed 62) transitions.
[2024-05-24 13:47:45] [INFO ] Flow matrix only has 86 transitions (discarded 8 similar events)
// Phase 1: matrix 86 rows 44 cols
[2024-05-24 13:47:45] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:47:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 13:47:45] [INFO ] Flow matrix only has 86 transitions (discarded 8 similar events)
[2024-05-24 13:47:45] [INFO ] Invariant cache hit.
[2024-05-24 13:47:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 13:47:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-24 13:47:45] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 13:47:45] [INFO ] Flow matrix only has 86 transitions (discarded 8 similar events)
[2024-05-24 13:47:45] [INFO ] Invariant cache hit.
[2024-05-24 13:47:45] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/79 places, 94/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 44/79 places, 94/156 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 146 ms.
Product exploration explored 100000 steps with 2 reset in 156 ms.
Computed a total of 10 stabilizing places and 27 stable transitions
Computed a total of 10 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 4267 steps, including 436 resets, run visited all 1 properties in 14 ms. (steps per millisecond=304 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 94/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-05-24 13:47:45] [INFO ] Flow matrix only has 86 transitions (discarded 8 similar events)
[2024-05-24 13:47:45] [INFO ] Invariant cache hit.
[2024-05-24 13:47:45] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 13:47:45] [INFO ] Flow matrix only has 86 transitions (discarded 8 similar events)
[2024-05-24 13:47:45] [INFO ] Invariant cache hit.
[2024-05-24 13:47:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 13:47:45] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-24 13:47:45] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-24 13:47:45] [INFO ] Flow matrix only has 86 transitions (discarded 8 similar events)
[2024-05-24 13:47:45] [INFO ] Invariant cache hit.
[2024-05-24 13:47:46] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 44/44 places, 94/94 transitions.
Computed a total of 10 stabilizing places and 27 stable transitions
Computed a total of 10 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1043 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17113 steps, run visited all 1 properties in 29 ms. (steps per millisecond=590 )
Probabilistic random walk after 17113 steps, saw 3852 distinct states, run finished after 29 ms. (steps per millisecond=590 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 52 ms.
Product exploration explored 100000 steps with 0 reset in 40 ms.
Built C files in :
/tmp/ltsmin13213903607403257641
[2024-05-24 13:47:46] [INFO ] Computing symmetric may disable matrix : 94 transitions.
[2024-05-24 13:47:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:47:46] [INFO ] Computing symmetric may enable matrix : 94 transitions.
[2024-05-24 13:47:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:47:46] [INFO ] Computing Do-Not-Accords matrix : 94 transitions.
[2024-05-24 13:47:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:47:46] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13213903607403257641
Running compilation step : cd /tmp/ltsmin13213903607403257641;'/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 200 ms.
Running link step : cd /tmp/ltsmin13213903607403257641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13213903607403257641;'/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/stateBased8653571971765409512.hoa' '--buchi-type=spotba'
LTSmin run took 98 ms.
FORMULA HealthRecord-PT-15-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-15-LTLFireability-05 finished in 1882 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))||G(p1)||G(p2)))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 60 transition count 118
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 60 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 55 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 55 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 53 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 53 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 53 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 52 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 52 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 52 transition count 88
Applied a total of 66 rules in 5 ms. Remains 52 /79 variables (removed 27) and now considering 88/156 (removed 68) transitions.
[2024-05-24 13:47:46] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 52 cols
[2024-05-24 13:47:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:47:46] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 13:47:46] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 13:47:46] [INFO ] Invariant cache hit.
[2024-05-24 13:47:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:46] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 13:47:46] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 13:47:46] [INFO ] Invariant cache hit.
[2024-05-24 13:47:47] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/79 places, 88/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 52/79 places, 88/156 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s12 1), p1:(OR (EQ s12 0) (EQ s8 0) (EQ s50 0)), p2:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 77 ms.
Product exploration explored 100000 steps with 5 reset in 59 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) p1 (NOT p2)), (X (AND p1 (NOT p0))), (X (AND p1 (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 196 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 914 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1541549 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :{0=1, 2=1, 3=1, 4=1}
Probabilistic random walk after 1541549 steps, saw 181507 distinct states, run finished after 3001 ms. (steps per millisecond=513 ) properties seen :4
Running SMT prover for 1 properties.
[2024-05-24 13:47:51] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 13:47:51] [INFO ] Invariant cache hit.
[2024-05-24 13:47:51] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:47:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:47:51] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND p1 (NOT p0))), (X (AND p1 (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 15 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-15-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-15-LTLFireability-07 finished in 4237 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 X(X(p1)))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 59 transition count 116
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 59 transition count 116
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 53 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 53 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 61 place count 53 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 51 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 51 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 51 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 50 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 50 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 50 transition count 82
Applied a total of 72 rules in 3 ms. Remains 50 /79 variables (removed 29) and now considering 82/156 (removed 74) transitions.
[2024-05-24 13:47:51] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 50 cols
[2024-05-24 13:47:51] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:47:51] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 13:47:51] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 13:47:51] [INFO ] Invariant cache hit.
[2024-05-24 13:47:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-24 13:47:51] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 13:47:51] [INFO ] Invariant cache hit.
[2024-05-24 13:47:51] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/79 places, 82/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 50/79 places, 82/156 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p1:(EQ s45 1), p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-08 finished in 419 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)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Graph (trivial) has 92 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 56 transition count 114
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 56 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 56 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 51 transition count 102
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 51 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 59 place count 51 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 49 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 49 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 49 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 48 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 48 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 48 transition count 80
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 4 with 2 rules applied. Total rules applied 73 place count 47 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 77 place count 45 transition count 93
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 45 transition count 91
Applied a total of 79 rules in 17 ms. Remains 45 /79 variables (removed 34) and now considering 91/156 (removed 65) transitions.
[2024-05-24 13:47:51] [INFO ] Flow matrix only has 84 transitions (discarded 7 similar events)
// Phase 1: matrix 84 rows 45 cols
[2024-05-24 13:47:51] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:47:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 13:47:51] [INFO ] Flow matrix only has 84 transitions (discarded 7 similar events)
[2024-05-24 13:47:51] [INFO ] Invariant cache hit.
[2024-05-24 13:47:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 13:47:51] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-24 13:47:51] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 13:47:51] [INFO ] Flow matrix only has 84 transitions (discarded 7 similar events)
[2024-05-24 13:47:51] [INFO ] Invariant cache hit.
[2024-05-24 13:47:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/79 places, 91/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 45/79 places, 91/156 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s12 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-09 finished in 204 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((X((X(p1) U p2))||F(p3)||p0)))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 60 transition count 118
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 60 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 54 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 54 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 59 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 52 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 52 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 52 transition count 88
Applied a total of 66 rules in 6 ms. Remains 52 /79 variables (removed 27) and now considering 88/156 (removed 68) transitions.
[2024-05-24 13:47:51] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 52 cols
[2024-05-24 13:47:51] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:47:51] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 13:47:51] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 13:47:51] [INFO ] Invariant cache hit.
[2024-05-24 13:47:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-24 13:47:51] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 13:47:51] [INFO ] Invariant cache hit.
[2024-05-24 13:47:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/79 places, 88/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 52/79 places, 88/156 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s15 0) (EQ s50 0) (EQ s24 1)), p3:(EQ s47 0), p2:(NEQ s24 1), p1:(EQ s31 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][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 49 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p3 p2 (NOT p1)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Incomplete random walk after 10000 steps, including 915 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1494496 steps, run timeout after 3001 ms. (steps per millisecond=497 ) properties seen :{}
Probabilistic random walk after 1494496 steps, saw 176261 distinct states, run finished after 3001 ms. (steps per millisecond=497 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-24 13:47:55] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2024-05-24 13:47:55] [INFO ] Invariant cache hit.
[2024-05-24 13:47:55] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 13:47:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:47:55] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-24 13:47:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:55] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-24 13:47:55] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-24 13:47:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2024-05-24 13:47:55] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-24 13:47:55] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 88/88 transitions.
Graph (trivial) has 42 edges and 52 vertex of which 6 / 52 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 183 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 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 48 transition count 76
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 46 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 45 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 21 place count 39 transition count 108
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 39 transition count 107
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 39 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 30 place count 35 transition count 103
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 35 transition count 101
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 43 place count 35 transition count 101
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 52 place count 35 transition count 101
Applied a total of 52 rules in 20 ms. Remains 35 /52 variables (removed 17) and now considering 101/88 (removed -13) transitions.
[2024-05-24 13:47:55] [INFO ] Flow matrix only has 83 transitions (discarded 18 similar events)
// Phase 1: matrix 83 rows 35 cols
[2024-05-24 13:47:55] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 13:47:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 35/52 places, 101/88 transitions.
Incomplete random walk after 10000 steps, including 771 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Finished probabilistic random walk after 4099 steps, run visited all 3 properties in 14 ms. (steps per millisecond=292 )
Probabilistic random walk after 4099 steps, saw 1219 distinct states, run finished after 14 ms. (steps per millisecond=292 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p2 (NOT p1)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (G (NOT (AND (NOT p3) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p3) p1)))]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p3) (NOT p1))), (F (AND (NOT p2) (NOT p3)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-15-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-15-LTLFireability-10 finished in 4370 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))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 58 transition count 114
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 58 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 52 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 52 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 52 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 50 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 50 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 70 place count 50 transition count 84
Applied a total of 70 rules in 6 ms. Remains 50 /79 variables (removed 29) and now considering 84/156 (removed 72) transitions.
[2024-05-24 13:47:56] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 50 cols
[2024-05-24 13:47:56] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:47:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 13:47:56] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2024-05-24 13:47:56] [INFO ] Invariant cache hit.
[2024-05-24 13:47:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:56] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-24 13:47:56] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2024-05-24 13:47:56] [INFO ] Invariant cache hit.
[2024-05-24 13:47:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/79 places, 84/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 50/79 places, 84/156 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s40 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-11 finished in 257 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))&&(G(p1) U p2)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 60 transition count 118
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 60 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 55 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 55 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 57 place count 55 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 54 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 54 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 54 transition count 93
Applied a total of 62 rules in 7 ms. Remains 54 /79 variables (removed 25) and now considering 93/156 (removed 63) transitions.
[2024-05-24 13:47:56] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 54 cols
[2024-05-24 13:47:56] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:47:56] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 13:47:56] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2024-05-24 13:47:56] [INFO ] Invariant cache hit.
[2024-05-24 13:47:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:56] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 13:47:56] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2024-05-24 13:47:56] [INFO ] Invariant cache hit.
[2024-05-24 13:47:56] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/79 places, 93/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 54/79 places, 93/156 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s27 1), p1:(NEQ s41 1), p0:(EQ s41 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 49 ms.
Product exploration explored 100000 steps with 6 reset in 89 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 p2) p1 p0), (X (AND (NOT p2) p1)), (X p0), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 110 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 925 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 13:47:57] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2024-05-24 13:47:57] [INFO ] Invariant cache hit.
[2024-05-24 13:47:57] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:47:57] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 13:47:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:57] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-24 13:47:57] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-24 13:47:57] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-24 13:47:57] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-24 13:47:57] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-24 13:47:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 148 ms
[2024-05-24 13:47:57] [INFO ] After 159ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:47:57] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:47:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:47:57] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 13:47:57] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 13:47:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 13:47:57] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-24 13:47:57] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 13:47:57] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-24 13:47:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 143 ms
[2024-05-24 13:47:57] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 13:47:57] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 93/93 transitions.
Graph (trivial) has 49 edges and 54 vertex of which 6 / 54 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 196 edges and 51 vertex of which 37 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 37 transition count 55
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 27 place count 37 transition count 47
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 43 place count 29 transition count 47
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 24 transition count 36
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 24 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 53 place count 24 transition count 35
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 55 place count 23 transition count 35
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 21 transition count 31
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 21 transition count 31
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 20 transition count 30
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 20 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 20 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 19 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 19 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 18 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 70 place count 15 transition count 25
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 76 place count 14 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 76 place count 14 transition count 18
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 80 place count 12 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 12 transition count 17
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 4 with 2 rules applied. Total rules applied 83 place count 11 transition count 16
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 86 place count 11 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 11 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 89 place count 10 transition count 11
Applied a total of 89 rules in 12 ms. Remains 10 /54 variables (removed 44) and now considering 11/93 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 10/54 places, 11/93 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) p1)), (X p0), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 10 factoid took 123 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-15-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-15-LTLFireability-12 finished in 1297 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(G(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 58 transition count 114
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 58 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 52 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 52 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 52 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 50 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 50 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 70 place count 50 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 49 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 49 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 49 transition count 79
Applied a total of 75 rules in 8 ms. Remains 49 /79 variables (removed 30) and now considering 79/156 (removed 77) transitions.
[2024-05-24 13:47:57] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 49 cols
[2024-05-24 13:47:57] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 13:47:57] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 13:47:57] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 13:47:57] [INFO ] Invariant cache hit.
[2024-05-24 13:47:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:47:57] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-24 13:47:57] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 13:47:57] [INFO ] Invariant cache hit.
[2024-05-24 13:47:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/79 places, 79/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 49/79 places, 79/156 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s12 1) (NEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 47 ms.
Product exploration explored 100000 steps with 3 reset in 48 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Finished random walk after 673 steps, including 63 resets, run visited all 1 properties in 3 ms. (steps per millisecond=224 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 92 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-15-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-15-LTLFireability-14 finished in 546 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(p0))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 156/156 transitions.
Graph (trivial) has 84 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 55 transition count 112
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 55 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 55 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 50 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 50 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 50 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 48 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 48 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 48 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 47 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 47 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 46 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 76 place count 44 transition count 96
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 44 transition count 94
Applied a total of 78 rules in 17 ms. Remains 44 /79 variables (removed 35) and now considering 94/156 (removed 62) transitions.
[2024-05-24 13:47:58] [INFO ] Flow matrix only has 86 transitions (discarded 8 similar events)
// Phase 1: matrix 86 rows 44 cols
[2024-05-24 13:47:58] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:47:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 13:47:58] [INFO ] Flow matrix only has 86 transitions (discarded 8 similar events)
[2024-05-24 13:47:58] [INFO ] Invariant cache hit.
[2024-05-24 13:47:58] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 13:47:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-24 13:47:58] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 13:47:58] [INFO ] Flow matrix only has 86 transitions (discarded 8 similar events)
[2024-05-24 13:47:58] [INFO ] Invariant cache hit.
[2024-05-24 13:47:58] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/79 places, 94/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 44/79 places, 94/156 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s32 1) (AND (EQ s21 1) (EQ s42 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-15 finished in 237 ms.
All properties solved by simple procedures.
Total runtime 22267 ms.

BK_STOP 1716558479536

--------------------
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-15"
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-15, 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-171640625800508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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