Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678513976747

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 05:52:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:52:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:52:59] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-11 05:52:59] [INFO ] Transformed 161 places.
[2023-03-11 05:52:59] [INFO ] Transformed 341 transitions.
[2023-03-11 05:52:59] [INFO ] Found NUPN structural information;
[2023-03-11 05:52:59] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-13-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 86 transition count 170
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 86 transition count 170
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 154 place count 82 transition count 162
Iterating global reduction 0 with 4 rules applied. Total rules applied 158 place count 82 transition count 162
Applied a total of 158 rules in 45 ms. Remains 82 /161 variables (removed 79) and now considering 162/313 (removed 151) transitions.
[2023-03-11 05:53:00] [INFO ] Flow matrix only has 157 transitions (discarded 5 similar events)
// Phase 1: matrix 157 rows 82 cols
[2023-03-11 05:53:00] [INFO ] Computed 11 place invariants in 16 ms
[2023-03-11 05:53:00] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-11 05:53:00] [INFO ] Flow matrix only has 157 transitions (discarded 5 similar events)
[2023-03-11 05:53:00] [INFO ] Invariant cache hit.
[2023-03-11 05:53:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:53:00] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-11 05:53:00] [INFO ] Flow matrix only has 157 transitions (discarded 5 similar events)
[2023-03-11 05:53:00] [INFO ] Invariant cache hit.
[2023-03-11 05:53:00] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/161 places, 162/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 82/161 places, 162/313 transitions.
Support contains 27 out of 82 places after structural reductions.
[2023-03-11 05:53:01] [INFO ] Flatten gal took : 59 ms
[2023-03-11 05:53:01] [INFO ] Flatten gal took : 29 ms
[2023-03-11 05:53:01] [INFO ] Input system was already deterministic with 162 transitions.
Support contains 25 out of 82 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 782 resets, run finished after 748 ms. (steps per millisecond=13 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 107 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-11 05:53:02] [INFO ] Flow matrix only has 157 transitions (discarded 5 similar events)
[2023-03-11 05:53:02] [INFO ] Invariant cache hit.
[2023-03-11 05:53:02] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 05:53:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-11 05:53:02] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 05:53:03] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 05:53:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:53:03] [INFO ] After 119ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-11 05:53:03] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 9 ms to minimize.
[2023-03-11 05:53:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 106 ms
[2023-03-11 05:53:03] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2023-03-11 05:53:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-11 05:53:03] [INFO ] After 549ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-11 05:53:03] [INFO ] After 991ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 15 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 162/162 transitions.
Graph (trivial) has 49 edges and 82 vertex of which 4 / 82 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 335 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 13 place count 68 transition count 131
Iterating global reduction 0 with 11 rules applied. Total rules applied 24 place count 68 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 66 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 66 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 65 transition count 126
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 61 transition count 156
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 61 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 40 place count 61 transition count 153
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 42 place count 60 transition count 153
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 60 transition count 149
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 56 transition count 149
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 56 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 56 transition count 148
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 56 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 55 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 55 transition count 146
Applied a total of 55 rules in 110 ms. Remains 55 /82 variables (removed 27) and now considering 146/162 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 55/82 places, 146/162 transitions.
Incomplete random walk after 10000 steps, including 1391 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 220 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 233 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 160 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 228 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 252 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 229 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 234 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:53:04] [INFO ] Flow matrix only has 129 transitions (discarded 17 similar events)
// Phase 1: matrix 129 rows 55 cols
[2023-03-11 05:53:04] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-11 05:53:04] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:53:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 05:53:04] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 05:53:05] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:53:05] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-11 05:53:05] [INFO ] After 46ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:53:05] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2023-03-11 05:53:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-11 05:53:05] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-11 05:53:05] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 16 ms.
Support contains 11 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 146/146 transitions.
Graph (complete) has 241 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 52 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 52 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 50 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 50 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 15 place count 50 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 49 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 49 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 49 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 48 transition count 128
Applied a total of 21 rules in 23 ms. Remains 48 /55 variables (removed 7) and now considering 128/146 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 48/55 places, 128/146 transitions.
Incomplete random walk after 10000 steps, including 1385 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 189 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 259 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 261 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 242 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Finished probabilistic random walk after 6754 steps, run visited all 6 properties in 65 ms. (steps per millisecond=103 )
Probabilistic random walk after 6754 steps, saw 1596 distinct states, run finished after 65 ms. (steps per millisecond=103 ) properties seen :6
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 8 stabilizing places and 12 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Graph (trivial) has 98 edges and 82 vertex of which 8 / 82 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 59 transition count 122
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 59 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 44 place count 52 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 51 place count 52 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 60 place count 52 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 49 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 49 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 69 place count 49 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 47 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 47 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 79 place count 47 transition count 77
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 3 with 4 rules applied. Total rules applied 83 place count 45 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 45 transition count 74
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 88 place count 43 transition count 88
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 43 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 42 transition count 83
Applied a total of 93 rules in 48 ms. Remains 42 /82 variables (removed 40) and now considering 83/162 (removed 79) transitions.
[2023-03-11 05:53:06] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-11 05:53:06] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 05:53:06] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 05:53:06] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2023-03-11 05:53:06] [INFO ] Invariant cache hit.
[2023-03-11 05:53:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 05:53:06] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-11 05:53:06] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-11 05:53:06] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2023-03-11 05:53:06] [INFO ] Invariant cache hit.
[2023-03-11 05:53:06] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/82 places, 83/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 42/82 places, 83/162 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s16 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 411 ms.
Product exploration explored 100000 steps with 3 reset in 165 ms.
Computed a total of 13 stabilizing places and 26 stable transitions
Computed a total of 13 stabilizing places and 26 stable transitions
Detected a total of 13/42 stabilizing places and 26/83 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1050 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1658 steps, run visited all 1 properties in 8 ms. (steps per millisecond=207 )
Probabilistic random walk after 1658 steps, saw 613 distinct states, run finished after 8 ms. (steps per millisecond=207 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-11 05:53:08] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2023-03-11 05:53:08] [INFO ] Invariant cache hit.
[2023-03-11 05:53:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 05:53:08] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2023-03-11 05:53:08] [INFO ] Invariant cache hit.
[2023-03-11 05:53:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 05:53:08] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-11 05:53:08] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-11 05:53:08] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2023-03-11 05:53:08] [INFO ] Invariant cache hit.
[2023-03-11 05:53:08] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 42/42 places, 83/83 transitions.
Computed a total of 13 stabilizing places and 26 stable transitions
Computed a total of 13 stabilizing places and 26 stable transitions
Detected a total of 13/42 stabilizing places and 26/83 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1037 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1658 steps, run visited all 1 properties in 12 ms. (steps per millisecond=138 )
Probabilistic random walk after 1658 steps, saw 613 distinct states, run finished after 12 ms. (steps per millisecond=138 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 4 reset in 98 ms.
Built C files in :
/tmp/ltsmin4019293588087165531
[2023-03-11 05:53:09] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2023-03-11 05:53:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:09] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2023-03-11 05:53:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:09] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2023-03-11 05:53:09] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:09] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4019293588087165531
Running compilation step : cd /tmp/ltsmin4019293588087165531;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 652 ms.
Running link step : cd /tmp/ltsmin4019293588087165531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4019293588087165531;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13286054548265998883.hoa' '--buchi-type=spotba'
LTSmin run took 180 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-13-LTLCardinality-00 finished in 4421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((((X(p0) U p0) U G(X(p0)))&&p1)))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Graph (trivial) has 69 edges and 82 vertex of which 6 / 82 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 61 transition count 125
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 61 transition count 125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 41 place count 55 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 55 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 53 place count 55 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 52 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 52 transition count 98
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 52 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 50 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 50 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 50 transition count 85
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 74 place count 49 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 49 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 47 transition count 99
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 82 place count 47 transition count 96
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 47 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 46 transition count 95
Applied a total of 84 rules in 41 ms. Remains 46 /82 variables (removed 36) and now considering 95/162 (removed 67) transitions.
[2023-03-11 05:53:10] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
// Phase 1: matrix 86 rows 46 cols
[2023-03-11 05:53:10] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 05:53:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 05:53:10] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
[2023-03-11 05:53:10] [INFO ] Invariant cache hit.
[2023-03-11 05:53:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 05:53:10] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-11 05:53:10] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 05:53:10] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
[2023-03-11 05:53:10] [INFO ] Invariant cache hit.
[2023-03-11 05:53:10] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/82 places, 95/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 46/82 places, 95/162 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s38 0) (EQ s45 1)), p0:(OR (EQ s27 0) (EQ s8 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3 reset in 150 ms.
Product exploration explored 100000 steps with 3 reset in 294 ms.
Computed a total of 13 stabilizing places and 29 stable transitions
Computed a total of 13 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 392 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1039 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:53:12] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
[2023-03-11 05:53:12] [INFO ] Invariant cache hit.
[2023-03-11 05:53:12] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:53:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 05:53:12] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 05:53:12] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 05:53:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 05:53:12] [INFO ] After 8ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 05:53:12] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 05:53:12] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 95/95 transitions.
Graph (complete) has 177 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 44 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 43 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 43 transition count 86
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 10 place count 42 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 41 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 40 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 40 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 19 place count 40 transition count 77
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 30 place count 40 transition count 66
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 41 place count 29 transition count 66
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 29 transition count 64
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 29 transition count 116
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 48 place count 27 transition count 115
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 51 place count 27 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 52 place count 26 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 53 place count 26 transition count 83
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 54 place count 25 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 25 transition count 81
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 65 place count 25 transition count 71
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 66 place count 25 transition count 71
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 67 place count 25 transition count 70
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 25 transition count 70
Applied a total of 68 rules in 35 ms. Remains 25 /46 variables (removed 21) and now considering 70/95 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 25/46 places, 70/95 transitions.
Incomplete random walk after 10000 steps, including 2551 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 278 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 218 steps, run visited all 1 properties in 5 ms. (steps per millisecond=43 )
Probabilistic random walk after 218 steps, saw 75 distinct states, run finished after 5 ms. (steps per millisecond=43 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 694 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 95/95 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /46 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-11 05:53:13] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
[2023-03-11 05:53:13] [INFO ] Invariant cache hit.
[2023-03-11 05:53:13] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 05:53:13] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
[2023-03-11 05:53:13] [INFO ] Invariant cache hit.
[2023-03-11 05:53:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 05:53:13] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-11 05:53:13] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 05:53:13] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
[2023-03-11 05:53:13] [INFO ] Invariant cache hit.
[2023-03-11 05:53:13] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 46/46 places, 95/95 transitions.
Computed a total of 13 stabilizing places and 29 stable transitions
Computed a total of 13 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1059 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Finished probabilistic random walk after 332134 steps, run visited all 3 properties in 357 ms. (steps per millisecond=930 )
Probabilistic random walk after 332134 steps, saw 44525 distinct states, run finished after 357 ms. (steps per millisecond=930 ) properties seen :3
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 468 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 75 ms.
Product exploration explored 100000 steps with 7 reset in 125 ms.
Built C files in :
/tmp/ltsmin428032762619714643
[2023-03-11 05:53:16] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2023-03-11 05:53:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:16] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2023-03-11 05:53:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:16] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2023-03-11 05:53:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin428032762619714643
Running compilation step : cd /tmp/ltsmin428032762619714643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 306 ms.
Running link step : cd /tmp/ltsmin428032762619714643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin428032762619714643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4286212665382731102.hoa' '--buchi-type=spotba'
LTSmin run took 154 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-13-LTLCardinality-01 finished in 6189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 63 transition count 126
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 63 transition count 126
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 58 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 58 transition count 116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 58 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 56 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 56 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 54 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 54 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 68 place count 54 transition count 94
Applied a total of 68 rules in 7 ms. Remains 54 /82 variables (removed 28) and now considering 94/162 (removed 68) transitions.
[2023-03-11 05:53:16] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
// Phase 1: matrix 91 rows 54 cols
[2023-03-11 05:53:16] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:53:16] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 05:53:16] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2023-03-11 05:53:16] [INFO ] Invariant cache hit.
[2023-03-11 05:53:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:53:16] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-11 05:53:16] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2023-03-11 05:53:16] [INFO ] Invariant cache hit.
[2023-03-11 05:53:16] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/82 places, 94/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 54/82 places, 94/162 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (NEQ s12 0) (NEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLCardinality-03 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 61 transition count 122
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 61 transition count 122
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 55 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 55 transition count 110
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 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 53 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 53 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 51 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 51 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 51 transition count 85
Applied a total of 77 rules in 8 ms. Remains 51 /82 variables (removed 31) and now considering 85/162 (removed 77) transitions.
[2023-03-11 05:53:17] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 51 cols
[2023-03-11 05:53:17] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 05:53:17] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 05:53:17] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2023-03-11 05:53:17] [INFO ] Invariant cache hit.
[2023-03-11 05:53:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:53:17] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-11 05:53:17] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2023-03-11 05:53:17] [INFO ] Invariant cache hit.
[2023-03-11 05:53:17] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/82 places, 85/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 51/82 places, 85/162 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s35 1) (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, null][false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLCardinality-06 finished in 451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 63 transition count 126
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 63 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 56 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 56 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 56 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 53 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 53 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 70 place count 53 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 51 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 51 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 80 place count 51 transition count 81
Applied a total of 80 rules in 7 ms. Remains 51 /82 variables (removed 31) and now considering 81/162 (removed 81) transitions.
[2023-03-11 05:53:17] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 51 cols
[2023-03-11 05:53:17] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:53:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 05:53:17] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2023-03-11 05:53:17] [INFO ] Invariant cache hit.
[2023-03-11 05:53:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:53:17] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-11 05:53:17] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2023-03-11 05:53:17] [INFO ] Invariant cache hit.
[2023-03-11 05:53:17] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/82 places, 81/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 51/82 places, 81/162 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-08 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 s15 0) (EQ s4 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 439 ms.
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-13-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-13-LTLCardinality-08 finished in 1159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Graph (trivial) has 95 edges and 82 vertex of which 6 / 82 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 59 transition count 122
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 59 transition count 122
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 45 place count 53 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 51 place count 53 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 60 place count 53 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 51 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 51 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 67 place count 51 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 50 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 50 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 50 transition count 87
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 3 with 4 rules applied. Total rules applied 76 place count 48 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 48 transition count 84
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 81 place count 46 transition count 103
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 84 place count 46 transition count 100
Applied a total of 84 rules in 21 ms. Remains 46 /82 variables (removed 36) and now considering 100/162 (removed 62) transitions.
[2023-03-11 05:53:18] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
// Phase 1: matrix 92 rows 46 cols
[2023-03-11 05:53:18] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:53:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-11 05:53:18] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2023-03-11 05:53:18] [INFO ] Invariant cache hit.
[2023-03-11 05:53:18] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-11 05:53:18] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-11 05:53:18] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 05:53:18] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2023-03-11 05:53:18] [INFO ] Invariant cache hit.
[2023-03-11 05:53:19] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/82 places, 100/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 46/82 places, 100/162 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s35 0) (EQ s11 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 7 reset in 59 ms.
Product exploration explored 100000 steps with 2 reset in 68 ms.
Computed a total of 11 stabilizing places and 32 stable transitions
Computed a total of 11 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 854 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 345603 steps, run visited all 1 properties in 523 ms. (steps per millisecond=660 )
Probabilistic random walk after 345603 steps, saw 47192 distinct states, run finished after 524 ms. (steps per millisecond=659 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-11 05:53:20] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2023-03-11 05:53:20] [INFO ] Invariant cache hit.
[2023-03-11 05:53:20] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 05:53:20] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2023-03-11 05:53:20] [INFO ] Invariant cache hit.
[2023-03-11 05:53:20] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-11 05:53:20] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-11 05:53:20] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-11 05:53:20] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2023-03-11 05:53:20] [INFO ] Invariant cache hit.
[2023-03-11 05:53:20] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 46/46 places, 100/100 transitions.
Computed a total of 11 stabilizing places and 32 stable transitions
Computed a total of 11 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 866 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 345603 steps, run visited all 1 properties in 513 ms. (steps per millisecond=673 )
Probabilistic random walk after 345603 steps, saw 47192 distinct states, run finished after 514 ms. (steps per millisecond=672 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 246 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 58 ms.
Product exploration explored 100000 steps with 6 reset in 64 ms.
Built C files in :
/tmp/ltsmin14893885115529104870
[2023-03-11 05:53:21] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2023-03-11 05:53:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:21] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2023-03-11 05:53:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:21] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2023-03-11 05:53:21] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:21] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14893885115529104870
Running compilation step : cd /tmp/ltsmin14893885115529104870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 453 ms.
Running link step : cd /tmp/ltsmin14893885115529104870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14893885115529104870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12697050892905020863.hoa' '--buchi-type=spotba'
LTSmin run took 276 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-13-LTLCardinality-09 finished in 3785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(F(p1)&&G(!p0))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Graph (trivial) has 89 edges and 82 vertex of which 6 / 82 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 62 transition count 128
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 62 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 38 place count 57 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 43 place count 57 transition count 117
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 49 place count 57 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 54 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 54 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 54 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 52 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 52 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 52 transition count 90
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 3 with 4 rules applied. Total rules applied 72 place count 50 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 48 transition count 104
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 48 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 47 transition count 99
Applied a total of 81 rules in 14 ms. Remains 47 /82 variables (removed 35) and now considering 99/162 (removed 63) transitions.
[2023-03-11 05:53:22] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
// Phase 1: matrix 90 rows 47 cols
[2023-03-11 05:53:22] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:53:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 05:53:22] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-11 05:53:22] [INFO ] Invariant cache hit.
[2023-03-11 05:53:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 05:53:22] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-11 05:53:22] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-11 05:53:22] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-11 05:53:22] [INFO ] Invariant cache hit.
[2023-03-11 05:53:22] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/82 places, 99/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 47/82 places, 99/162 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s26 0) (EQ s29 1)), p0:(OR (EQ s10 0) (EQ s27 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9 reset in 53 ms.
Product exploration explored 100000 steps with 2 reset in 62 ms.
Computed a total of 14 stabilizing places and 33 stable transitions
Computed a total of 14 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false]
Incomplete random walk after 10000 steps, including 1046 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 05:53:23] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-11 05:53:23] [INFO ] Invariant cache hit.
[2023-03-11 05:53:23] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:53:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 05:53:23] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 05:53:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 05:53:23] [INFO ] After 18ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 05:53:23] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 05:53:23] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 99/99 transitions.
Graph (complete) has 172 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 46 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 44 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 44 transition count 89
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 13 place count 43 transition count 89
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 43 transition count 80
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 31 place count 34 transition count 80
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 34 transition count 78
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 34 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 3 with 2 rules applied. Total rules applied 36 place count 33 transition count 140
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 39 place count 33 transition count 137
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 32 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 32 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 31 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 31 transition count 101
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 53 place count 31 transition count 91
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 31 transition count 91
Applied a total of 54 rules in 17 ms. Remains 31 /47 variables (removed 16) and now considering 91/99 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 31/47 places, 91/99 transitions.
Incomplete random walk after 10000 steps, including 2073 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 523 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:53:23] [INFO ] Flow matrix only has 63 transitions (discarded 28 similar events)
// Phase 1: matrix 63 rows 31 cols
[2023-03-11 05:53:23] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 05:53:23] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:53:23] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 05:53:24] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:53:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-11 05:53:24] [INFO ] After 8ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:53:24] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 05:53:24] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 31/31 places, 91/91 transitions.
Finished random walk after 1213 steps, including 253 resets, run visited all 1 properties in 3 ms. (steps per millisecond=404 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 460 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false]
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-11 05:53:24] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
// Phase 1: matrix 90 rows 47 cols
[2023-03-11 05:53:24] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:53:24] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-11 05:53:24] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-11 05:53:24] [INFO ] Invariant cache hit.
[2023-03-11 05:53:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 05:53:24] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-11 05:53:24] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-11 05:53:24] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-11 05:53:24] [INFO ] Invariant cache hit.
[2023-03-11 05:53:25] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 47/47 places, 99/99 transitions.
Computed a total of 14 stabilizing places and 33 stable transitions
Computed a total of 14 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 319 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false]
Incomplete random walk after 10000 steps, including 1034 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-11 05:53:25] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2023-03-11 05:53:25] [INFO ] Invariant cache hit.
[2023-03-11 05:53:25] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:53:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 05:53:25] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:53:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 05:53:25] [INFO ] After 8ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:53:25] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 05:53:25] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 99/99 transitions.
Graph (complete) has 172 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 46 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 44 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 44 transition count 89
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 13 place count 43 transition count 89
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 43 transition count 80
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 31 place count 34 transition count 80
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 34 transition count 78
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 34 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 3 with 2 rules applied. Total rules applied 36 place count 33 transition count 140
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 39 place count 33 transition count 137
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 32 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 32 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 31 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 31 transition count 101
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 53 place count 31 transition count 91
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 54 place count 31 transition count 91
Applied a total of 54 rules in 20 ms. Remains 31 /47 variables (removed 16) and now considering 91/99 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 31/47 places, 91/99 transitions.
Finished random walk after 5528 steps, including 1166 resets, run visited all 1 properties in 11 ms. (steps per millisecond=502 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 411 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false]
Product exploration explored 100000 steps with 8 reset in 53 ms.
Product exploration explored 100000 steps with 3 reset in 64 ms.
Built C files in :
/tmp/ltsmin8595256419554299461
[2023-03-11 05:53:26] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2023-03-11 05:53:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:26] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2023-03-11 05:53:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:26] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2023-03-11 05:53:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:53:26] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8595256419554299461
Running compilation step : cd /tmp/ltsmin8595256419554299461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 291 ms.
Running link step : cd /tmp/ltsmin8595256419554299461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8595256419554299461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4965111511145939237.hoa' '--buchi-type=spotba'
LTSmin run took 3606 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-13-LTLCardinality-10 finished in 8365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Graph (trivial) has 95 edges and 82 vertex of which 8 / 82 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 60 transition count 125
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 60 transition count 125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 41 place count 54 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 54 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 53 place count 54 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 51 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 51 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 51 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 49 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 49 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 49 transition count 86
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 3 with 4 rules applied. Total rules applied 75 place count 47 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 47 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 45 transition count 99
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 45 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 44 transition count 94
Applied a total of 85 rules in 18 ms. Remains 44 /82 variables (removed 38) and now considering 94/162 (removed 68) transitions.
[2023-03-11 05:53:30] [INFO ] Flow matrix only has 85 transitions (discarded 9 similar events)
// Phase 1: matrix 85 rows 44 cols
[2023-03-11 05:53:30] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 05:53:31] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 05:53:31] [INFO ] Flow matrix only has 85 transitions (discarded 9 similar events)
[2023-03-11 05:53:31] [INFO ] Invariant cache hit.
[2023-03-11 05:53:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 05:53:31] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-11 05:53:31] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-11 05:53:31] [INFO ] Flow matrix only has 85 transitions (discarded 9 similar events)
[2023-03-11 05:53:31] [INFO ] Invariant cache hit.
[2023-03-11 05:53:31] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/82 places, 94/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 44/82 places, 94/162 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLCardinality-11 finished in 336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 62 transition count 124
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 62 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 55 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 55 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 63 place count 55 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 52 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 52 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 72 place count 52 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 50 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 50 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 82 place count 50 transition count 79
Applied a total of 82 rules in 6 ms. Remains 50 /82 variables (removed 32) and now considering 79/162 (removed 83) transitions.
[2023-03-11 05:53:31] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2023-03-11 05:53:31] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:53:31] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 05:53:31] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 05:53:31] [INFO ] Invariant cache hit.
[2023-03-11 05:53:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:53:31] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-11 05:53:31] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 05:53:31] [INFO ] Invariant cache hit.
[2023-03-11 05:53:31] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/82 places, 79/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 50/82 places, 79/162 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s27 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 141 ms.
Product exploration explored 100000 steps with 50000 reset in 151 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), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-13-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-13-LTLCardinality-12 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 63 transition count 126
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 63 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 57 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 57 transition count 113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 57 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 54 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 54 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 54 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 52 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 52 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 74 place count 52 transition count 87
Applied a total of 74 rules in 5 ms. Remains 52 /82 variables (removed 30) and now considering 87/162 (removed 75) transitions.
[2023-03-11 05:53:31] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2023-03-11 05:53:31] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:53:31] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-11 05:53:31] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2023-03-11 05:53:31] [INFO ] Invariant cache hit.
[2023-03-11 05:53:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:53:32] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-11 05:53:32] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2023-03-11 05:53:32] [INFO ] Invariant cache hit.
[2023-03-11 05:53:32] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/82 places, 87/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 52/82 places, 87/162 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s31 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLCardinality-14 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 162/162 transitions.
Graph (trivial) has 95 edges and 82 vertex of which 8 / 82 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 60 transition count 125
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 60 transition count 125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 41 place count 54 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 54 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 54 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 52 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 52 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 52 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 51 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 51 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 51 transition count 90
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 3 with 4 rules applied. Total rules applied 72 place count 49 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 49 transition count 87
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 77 place count 47 transition count 106
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 47 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 46 transition count 101
Applied a total of 82 rules in 24 ms. Remains 46 /82 variables (removed 36) and now considering 101/162 (removed 61) transitions.
[2023-03-11 05:53:32] [INFO ] Flow matrix only has 92 transitions (discarded 9 similar events)
// Phase 1: matrix 92 rows 46 cols
[2023-03-11 05:53:32] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:53:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-11 05:53:32] [INFO ] Flow matrix only has 92 transitions (discarded 9 similar events)
[2023-03-11 05:53:32] [INFO ] Invariant cache hit.
[2023-03-11 05:53:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 05:53:32] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-11 05:53:32] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 05:53:32] [INFO ] Flow matrix only has 92 transitions (discarded 9 similar events)
[2023-03-11 05:53:32] [INFO ] Invariant cache hit.
[2023-03-11 05:53:32] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/82 places, 101/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 46/82 places, 101/162 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-13-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s19 0) (EQ s27 1)), p0:(OR (EQ s19 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 27 steps with 2 reset in 1 ms.
FORMULA HealthRecord-PT-13-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-LTLCardinality-15 finished in 395 ms.
All properties solved by simple procedures.
Total runtime 33084 ms.

BK_STOP 1678514013983

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-13"
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-5348"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-13, 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 r197-smll-167840344100331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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