Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 5.6K Apr 30 11:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 30 11:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 11:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 11:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 68K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652694103684

Running Version 202205111006
[2022-05-16 09:41:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:41:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:41:46] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2022-05-16 09:41:46] [INFO ] Transformed 157 places.
[2022-05-16 09:41:46] [INFO ] Transformed 327 transitions.
[2022-05-16 09:41:46] [INFO ] Found NUPN structural information;
[2022-05-16 09:41:46] [INFO ] Parsed PT model containing 157 places and 327 transitions in 358 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-09-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 86 transition count 164
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 86 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 145 place count 83 transition count 158
Iterating global reduction 0 with 3 rules applied. Total rules applied 148 place count 83 transition count 158
Applied a total of 148 rules in 41 ms. Remains 83 /157 variables (removed 74) and now considering 158/301 (removed 143) transitions.
[2022-05-16 09:41:46] [INFO ] Flow matrix only has 151 transitions (discarded 7 similar events)
// Phase 1: matrix 151 rows 83 cols
[2022-05-16 09:41:46] [INFO ] Computed 13 place invariants in 23 ms
[2022-05-16 09:41:46] [INFO ] Implicit Places using invariants in 401 ms returned []
[2022-05-16 09:41:46] [INFO ] Flow matrix only has 151 transitions (discarded 7 similar events)
// Phase 1: matrix 151 rows 83 cols
[2022-05-16 09:41:46] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 09:41:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:41:47] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2022-05-16 09:41:47] [INFO ] Flow matrix only has 151 transitions (discarded 7 similar events)
// Phase 1: matrix 151 rows 83 cols
[2022-05-16 09:41:47] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 09:41:47] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/157 places, 158/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/157 places, 158/301 transitions.
Support contains 29 out of 83 places after structural reductions.
[2022-05-16 09:41:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-16 09:41:47] [INFO ] Flatten gal took : 85 ms
FORMULA HealthRecord-PT-09-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 09:41:47] [INFO ] Flatten gal took : 31 ms
[2022-05-16 09:41:47] [INFO ] Input system was already deterministic with 158 transitions.
Incomplete random walk after 10000 steps, including 591 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 18) seen :7
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-05-16 09:41:49] [INFO ] Flow matrix only has 151 transitions (discarded 7 similar events)
// Phase 1: matrix 151 rows 83 cols
[2022-05-16 09:41:49] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 09:41:49] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-16 09:41:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-16 09:41:49] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-16 09:41:49] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2022-05-16 09:41:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:41:50] [INFO ] After 110ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2022-05-16 09:41:50] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 6 ms to minimize.
[2022-05-16 09:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-16 09:41:50] [INFO ] After 388ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 143 ms.
[2022-05-16 09:41:50] [INFO ] After 925ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 18 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 158/158 transitions.
Graph (trivial) has 69 edges and 83 vertex of which 8 / 83 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 349 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 78 transition count 141
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 77 transition count 140
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 77 transition count 137
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 72 transition count 137
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 18 place count 67 transition count 127
Iterating global reduction 2 with 5 rules applied. Total rules applied 23 place count 67 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 66 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 66 transition count 125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 64 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 64 transition count 122
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 40 place count 59 transition count 169
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 59 transition count 168
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 44 place count 59 transition count 165
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 47 place count 56 transition count 165
Applied a total of 47 rules in 82 ms. Remains 56 /83 variables (removed 27) and now considering 165/158 (removed -7) transitions.
Finished structural reductions, in 1 iterations. Remains : 56/83 places, 165/158 transitions.
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-16 09:41:51] [INFO ] Flow matrix only has 150 transitions (discarded 15 similar events)
// Phase 1: matrix 150 rows 56 cols
[2022-05-16 09:41:51] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 09:41:51] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-16 09:41:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 09:41:51] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 09:41:52] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-16 09:41:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-16 09:41:52] [INFO ] After 66ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-16 09:41:52] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-16 09:41:52] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 4 ms.
Support contains 10 out of 56 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 56/56 places, 165/165 transitions.
Graph (complete) has 277 edges and 56 vertex of which 53 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 52 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 52 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 51 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 51 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 50 transition count 159
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 48 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 47 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 47 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 18 place count 47 transition count 149
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 47 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 46 transition count 141
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 46 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 46 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 45 transition count 140
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 45 transition count 140
Applied a total of 28 rules in 59 ms. Remains 45 /56 variables (removed 11) and now considering 140/165 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/56 places, 140/165 transitions.
Incomplete random walk after 10000 steps, including 3064 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 534 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 544 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 544 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 523 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 540 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 557 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Finished probabilistic random walk after 4271 steps, run visited all 6 properties in 68 ms. (steps per millisecond=62 )
Probabilistic random walk after 4271 steps, saw 1074 distinct states, run finished after 68 ms. (steps per millisecond=62 ) properties seen :6
FORMULA HealthRecord-PT-09-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 6 stabilizing places and 8 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 158/158 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 63 transition count 122
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 63 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 56 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 56 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 63 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 54 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 54 transition count 93
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 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 53 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 53 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 75 place count 53 transition count 85
Applied a total of 75 rules in 15 ms. Remains 53 /83 variables (removed 30) and now considering 85/158 (removed 73) transitions.
[2022-05-16 09:41:53] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 53 cols
[2022-05-16 09:41:53] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:41:53] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-05-16 09:41:53] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 53 cols
[2022-05-16 09:41:53] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:41:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:41:53] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-05-16 09:41:53] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 53 cols
[2022-05-16 09:41:53] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:41:53] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/83 places, 85/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/83 places, 85/158 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s35 0) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 424 ms.
Product exploration explored 100000 steps with 50000 reset in 265 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HealthRecord-PT-09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-09-LTLCardinality-01 finished in 1456 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 158/158 transitions.
Graph (trivial) has 92 edges and 83 vertex of which 10 / 83 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 59 transition count 120
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 59 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 44 place count 52 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 51 place count 52 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 60 place count 52 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 51 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 51 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 51 transition count 91
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 67 place count 50 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 50 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 48 transition count 111
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 48 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 47 transition count 107
Applied a total of 76 rules in 48 ms. Remains 47 /83 variables (removed 36) and now considering 107/158 (removed 51) transitions.
[2022-05-16 09:41:54] [INFO ] Flow matrix only has 96 transitions (discarded 11 similar events)
// Phase 1: matrix 96 rows 47 cols
[2022-05-16 09:41:54] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:41:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-05-16 09:41:54] [INFO ] Flow matrix only has 96 transitions (discarded 11 similar events)
// Phase 1: matrix 96 rows 47 cols
[2022-05-16 09:41:54] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-16 09:41:54] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-16 09:41:54] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2022-05-16 09:41:55] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-16 09:41:55] [INFO ] Flow matrix only has 96 transitions (discarded 11 similar events)
// Phase 1: matrix 96 rows 47 cols
[2022-05-16 09:41:55] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:41:55] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/83 places, 107/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/83 places, 107/158 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s25 0) (EQ s36 1) (OR (EQ s5 0) (EQ s41 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 6 ms.
FORMULA HealthRecord-PT-09-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLCardinality-02 finished in 431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(G(p0))))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 158/158 transitions.
Graph (trivial) has 97 edges and 83 vertex of which 12 / 83 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 57 transition count 117
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 57 transition count 117
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 46 place count 50 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 53 place count 50 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 59 place count 50 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 48 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 48 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 48 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 47 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 47 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 47 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 46 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 46 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 78 place count 44 transition count 100
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 81 place count 44 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 43 transition count 96
Applied a total of 82 rules in 40 ms. Remains 43 /83 variables (removed 40) and now considering 96/158 (removed 62) transitions.
[2022-05-16 09:41:55] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 43 cols
[2022-05-16 09:41:55] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:41:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-16 09:41:55] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 43 cols
[2022-05-16 09:41:55] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 09:41:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 09:41:55] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2022-05-16 09:41:55] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-16 09:41:55] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 43 cols
[2022-05-16 09:41:55] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-16 09:41:55] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/83 places, 96/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/83 places, 96/158 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s34 0) (EQ s5 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 6 reset in 316 ms.
Product exploration explored 100000 steps with 2 reset in 122 ms.
Computed a total of 14 stabilizing places and 25 stable transitions
Computed a total of 14 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Finished random walk after 1604 steps, including 170 resets, run visited all 1 properties in 9 ms. (steps per millisecond=178 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2022-05-16 09:41:56] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 43 cols
[2022-05-16 09:41:56] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:41:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-16 09:41:56] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 43 cols
[2022-05-16 09:41:56] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:41:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 09:41:56] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-05-16 09:41:56] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-16 09:41:56] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 43 cols
[2022-05-16 09:41:56] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:41:56] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/43 places, 96/96 transitions.
Computed a total of 14 stabilizing places and 25 stable transitions
Computed a total of 14 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 1026 steps, including 104 resets, run visited all 1 properties in 4 ms. (steps per millisecond=256 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 67 ms.
Product exploration explored 100000 steps with 0 reset in 318 ms.
Built C files in :
/tmp/ltsmin4470569467304508394
[2022-05-16 09:41:57] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2022-05-16 09:41:57] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:41:57] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2022-05-16 09:41:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:41:57] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2022-05-16 09:41:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:41:57] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4470569467304508394
Running compilation step : cd /tmp/ltsmin4470569467304508394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 527 ms.
Running link step : cd /tmp/ltsmin4470569467304508394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin4470569467304508394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11445112847832119283.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA HealthRecord-PT-09-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-09-LTLCardinality-04 finished in 3228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 158/158 transitions.
Graph (trivial) has 97 edges and 83 vertex of which 12 / 83 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 57 transition count 117
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 57 transition count 117
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 47 place count 49 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 55 place count 49 transition count 100
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 63 place count 49 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 46 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 46 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 46 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 44 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 44 transition count 77
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 82 place count 44 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 43 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 43 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 41 transition count 83
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 41 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 40 transition count 79
Applied a total of 93 rules in 20 ms. Remains 40 /83 variables (removed 43) and now considering 79/158 (removed 79) transitions.
[2022-05-16 09:41:58] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
// Phase 1: matrix 69 rows 40 cols
[2022-05-16 09:41:58] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:41:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-05-16 09:41:58] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
// Phase 1: matrix 69 rows 40 cols
[2022-05-16 09:41:58] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:41:58] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-16 09:41:58] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-05-16 09:41:58] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-16 09:41:58] [INFO ] Flow matrix only has 69 transitions (discarded 10 similar events)
// Phase 1: matrix 69 rows 40 cols
[2022-05-16 09:41:58] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:41:58] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/83 places, 79/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/83 places, 79/158 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 44 steps with 3 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLCardinality-06 finished in 385 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(X(X((F(p0)||(X(p1) U p2))))))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 158/158 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 66 transition count 127
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 66 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 59 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 59 transition count 113
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 57 place count 59 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 57 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 57 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 55 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 55 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 55 transition count 88
Applied a total of 71 rules in 4 ms. Remains 55 /83 variables (removed 28) and now considering 88/158 (removed 70) transitions.
[2022-05-16 09:41:58] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 55 cols
[2022-05-16 09:41:58] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:41:58] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-05-16 09:41:58] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 55 cols
[2022-05-16 09:41:58] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 09:41:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:41:58] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2022-05-16 09:41:58] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 55 cols
[2022-05-16 09:41:58] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 09:41:59] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/83 places, 88/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/83 places, 88/158 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s18 0) (EQ s39 1)), p2:(OR (EQ s25 0) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 175 ms.
Product exploration explored 100000 steps with 25000 reset in 185 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 608 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 86 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1003 steps, run visited all 1 properties in 12 ms. (steps per millisecond=83 )
Probabilistic random walk after 1003 steps, saw 465 distinct states, run finished after 12 ms. (steps per millisecond=83 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 55 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2022-05-16 09:42:00] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 55 cols
[2022-05-16 09:42:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:42:00] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-05-16 09:42:00] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 55 cols
[2022-05-16 09:42:00] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:42:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:00] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2022-05-16 09:42:00] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 55 cols
[2022-05-16 09:42:00] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 09:42:00] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 88/88 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 6665 steps, including 394 resets, run visited all 1 properties in 16 ms. (steps per millisecond=416 )
Knowledge obtained : [(AND (NOT p0) p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 162 ms.
Product exploration explored 100000 steps with 25000 reset in 178 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (trivial) has 49 edges and 55 vertex of which 10 / 55 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 48 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 48 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 48 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 47 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 47 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 46 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 46 transition count 73
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 13 place count 46 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 46 transition count 71
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 19 place count 46 transition count 108
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 46 transition count 106
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 21 rules in 14 ms. Remains 46 /55 variables (removed 9) and now considering 106/88 (removed -18) transitions.
[2022-05-16 09:42:02] [INFO ] Redundant transitions in 41 ms returned []
[2022-05-16 09:42:02] [INFO ] Flow matrix only has 95 transitions (discarded 11 similar events)
// Phase 1: matrix 95 rows 46 cols
[2022-05-16 09:42:02] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:42:02] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/55 places, 106/88 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/55 places, 106/88 transitions.
Product exploration explored 100000 steps with 25000 reset in 478 ms.
Product exploration explored 100000 steps with 25000 reset in 446 ms.
Built C files in :
/tmp/ltsmin6987155156958785122
[2022-05-16 09:42:03] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6987155156958785122
Running compilation step : cd /tmp/ltsmin6987155156958785122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 250 ms.
Running link step : cd /tmp/ltsmin6987155156958785122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6987155156958785122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1954109233676187435.hoa' '--buchi-type=spotba'
LTSmin run took 165 ms.
FORMULA HealthRecord-PT-09-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-09-LTLCardinality-09 finished in 5321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))||G(G(p1))||p0)))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 158/158 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 66 transition count 128
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 66 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 60 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 60 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 55 place count 60 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 59 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 59 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 58 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 58 transition count 102
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 58 transition count 99
Applied a total of 62 rules in 4 ms. Remains 58 /83 variables (removed 25) and now considering 99/158 (removed 59) transitions.
[2022-05-16 09:42:04] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
// Phase 1: matrix 96 rows 58 cols
[2022-05-16 09:42:04] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:04] [INFO ] Implicit Places using invariants in 188 ms returned []
[2022-05-16 09:42:04] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
// Phase 1: matrix 96 rows 58 cols
[2022-05-16 09:42:04] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:42:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:04] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2022-05-16 09:42:04] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
// Phase 1: matrix 96 rows 58 cols
[2022-05-16 09:42:04] [INFO ] Computed 9 place invariants in 6 ms
[2022-05-16 09:42:04] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/83 places, 99/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/83 places, 99/158 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s35 0) (EQ s9 1)), p1:(AND (EQ s32 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLCardinality-10 finished in 702 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1&&X(p2))))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 158/158 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 67 transition count 130
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 67 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 64 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 64 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 62 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 62 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 60 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 60 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 52 place count 60 transition count 108
Applied a total of 52 rules in 12 ms. Remains 60 /83 variables (removed 23) and now considering 108/158 (removed 50) transitions.
[2022-05-16 09:42:04] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
// Phase 1: matrix 105 rows 60 cols
[2022-05-16 09:42:04] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:04] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-05-16 09:42:04] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
// Phase 1: matrix 105 rows 60 cols
[2022-05-16 09:42:04] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:05] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-05-16 09:42:05] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
// Phase 1: matrix 105 rows 60 cols
[2022-05-16 09:42:05] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:42:05] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/83 places, 108/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/83 places, 108/158 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s49 0) (EQ s31 1)), p0:(OR (EQ s54 0) (EQ s30 1)), p2:(OR (EQ s8 0) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 20 factoid took 343 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA HealthRecord-PT-09-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-09-LTLCardinality-13 finished in 1330 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U !p1)||X(p2)))))'
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 158/158 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 65 transition count 124
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 65 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 58 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 58 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 59 place count 58 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 55 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 55 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 55 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 53 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 53 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 53 transition count 79
Applied a total of 78 rules in 10 ms. Remains 53 /83 variables (removed 30) and now considering 79/158 (removed 79) transitions.
[2022-05-16 09:42:06] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 53 cols
[2022-05-16 09:42:06] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 09:42:06] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-16 09:42:06] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 53 cols
[2022-05-16 09:42:06] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 09:42:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:06] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2022-05-16 09:42:06] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 53 cols
[2022-05-16 09:42:06] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 09:42:06] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/83 places, 79/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/83 places, 79/158 transitions.
Stuttering acceptance computed with spot in 504 ms :[(NOT p0), (AND p1 (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (NOT p0) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true]
Running random walk in product with property : HealthRecord-PT-09-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p0:(OR (EQ s7 0) (EQ s32 1)), p1:(OR (EQ s50 0) (EQ s30 1)), p2:(OR (EQ s30 0) (EQ s47 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]]
Product exploration explored 100000 steps with 25000 reset in 264 ms.
Product exploration explored 100000 steps with 25000 reset in 245 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 p1 p2), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 8 states, 14 edges and 3 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), true]
Incomplete random walk after 10000 steps, including 590 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-16 09:42:08] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 53 cols
[2022-05-16 09:42:08] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 09:42:08] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 09:42:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 09:42:08] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-16 09:42:08] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-16 09:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:08] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-05-16 09:42:08] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-16 09:42:08] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 53/53 places, 79/79 transitions.
Graph (trivial) has 45 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 185 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 2 place count 47 transition count 60
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 42 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 41 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 41 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 41 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 40 transition count 57
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 34 transition count 95
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 34 transition count 94
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 34 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 32 transition count 92
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 32 transition count 91
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 32 transition count 91
Applied a total of 43 rules in 18 ms. Remains 32 /53 variables (removed 21) and now considering 91/79 (removed -12) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/53 places, 91/79 transitions.
Incomplete random walk after 10000 steps, including 3375 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 375 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 394 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1352 steps, run visited all 2 properties in 9 ms. (steps per millisecond=150 )
Probabilistic random walk after 1352 steps, saw 522 distinct states, run finished after 10 ms. (steps per millisecond=135 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (G (NOT (AND (NOT p2) p0 p1))), (G (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 348 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 211 ms :[false, false, (AND (NOT p2) (NOT p0)), (OR (NOT p0) p2), false]
Stuttering acceptance computed with spot in 209 ms :[false, false, (AND (NOT p2) (NOT p0)), (OR (NOT p0) p2), false]
Support contains 4 out of 53 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 79/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2022-05-16 09:42:09] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 53 cols
[2022-05-16 09:42:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 09:42:09] [INFO ] Implicit Places using invariants in 198 ms returned []
[2022-05-16 09:42:09] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 53 cols
[2022-05-16 09:42:09] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 09:42:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:42:10] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2022-05-16 09:42:10] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 53 cols
[2022-05-16 09:42:10] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 09:42:10] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 79/79 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p2 p0), (X (OR (NOT p0) p2)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 592 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3043000 steps, run timeout after 3001 ms. (steps per millisecond=1013 ) properties seen :{1=1}
Probabilistic random walk after 3043000 steps, saw 328972 distinct states, run finished after 3003 ms. (steps per millisecond=1013 ) properties seen :1
Running SMT prover for 1 properties.
[2022-05-16 09:42:13] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 53 cols
[2022-05-16 09:42:13] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 09:42:13] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:42:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 09:42:13] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 09:42:13] [INFO ] After 39ms 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 p2 p0), (X (OR (NOT p0) p2)), (X (X p2)), (G (OR (NOT p0) p2))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 25000 reset in 164 ms.
Product exploration explored 100000 steps with 25000 reset in 175 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 79/79 transitions.
Graph (trivial) has 48 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 45 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 45 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 45 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 44 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 44 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 44 transition count 115
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 44 transition count 113
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 18 ms. Remains 44 /53 variables (removed 9) and now considering 113/79 (removed -34) transitions.
[2022-05-16 09:42:15] [INFO ] Redundant transitions in 39 ms returned []
[2022-05-16 09:42:15] [INFO ] Flow matrix only has 99 transitions (discarded 14 similar events)
// Phase 1: matrix 99 rows 44 cols
[2022-05-16 09:42:15] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:42:15] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/53 places, 113/79 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/53 places, 113/79 transitions.
Product exploration explored 100000 steps with 25000 reset in 351 ms.
Product exploration explored 100000 steps with 25000 reset in 356 ms.
Built C files in :
/tmp/ltsmin5937925430130542710
[2022-05-16 09:42:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5937925430130542710
Running compilation step : cd /tmp/ltsmin5937925430130542710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin5937925430130542710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5937925430130542710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12413706831613012937.hoa' '--buchi-type=spotba'
LTSmin run took 146 ms.
FORMULA HealthRecord-PT-09-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-09-LTLCardinality-15 finished in 10219 ms.
All properties solved by simple procedures.
Total runtime 30634 ms.

BK_STOP 1652694136530

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477300139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-09.tgz
mv HealthRecord-PT-09 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;