fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477300163
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for HealthRecord-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
294.140 34067.00 62512.00 422.70 FFTTTFFTFFFFTTFF normal

Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652694723587

Running Version 202205111006
[2022-05-16 09:52:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:52:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:52:06] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2022-05-16 09:52:06] [INFO ] Transformed 160 places.
[2022-05-16 09:52:06] [INFO ] Transformed 340 transitions.
[2022-05-16 09:52:06] [INFO ] Found NUPN structural information;
[2022-05-16 09:52:06] [INFO ] Parsed PT model containing 160 places and 340 transitions in 453 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 81 transition count 159
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 81 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 164 place count 75 transition count 147
Iterating global reduction 0 with 6 rules applied. Total rules applied 170 place count 75 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 175 place count 75 transition count 142
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 176 place count 74 transition count 139
Iterating global reduction 1 with 1 rules applied. Total rules applied 177 place count 74 transition count 139
Applied a total of 177 rules in 63 ms. Remains 74 /160 variables (removed 86) and now considering 139/312 (removed 173) transitions.
[2022-05-16 09:52:07] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
// Phase 1: matrix 132 rows 74 cols
[2022-05-16 09:52:07] [INFO ] Computed 13 place invariants in 21 ms
[2022-05-16 09:52:07] [INFO ] Implicit Places using invariants in 331 ms returned []
[2022-05-16 09:52:07] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
// Phase 1: matrix 132 rows 74 cols
[2022-05-16 09:52:07] [INFO ] Computed 13 place invariants in 8 ms
[2022-05-16 09:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:52:07] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2022-05-16 09:52:07] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
// Phase 1: matrix 132 rows 74 cols
[2022-05-16 09:52:07] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 09:52:07] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/160 places, 139/312 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/160 places, 139/312 transitions.
Support contains 27 out of 74 places after structural reductions.
[2022-05-16 09:52:08] [INFO ] Flatten gal took : 87 ms
[2022-05-16 09:52:08] [INFO ] Flatten gal took : 38 ms
[2022-05-16 09:52:08] [INFO ] Input system was already deterministic with 139 transitions.
Support contains 23 out of 74 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 725 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-16 09:52:09] [INFO ] Flow matrix only has 132 transitions (discarded 7 similar events)
// Phase 1: matrix 132 rows 74 cols
[2022-05-16 09:52:09] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 09:52:09] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-16 09:52:09] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:52:09] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-16 09:52:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:52:09] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:2
[2022-05-16 09:52:09] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-16 09:52:09] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2022-05-16 09:52:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2022-05-16 09:52:09] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-16 09:52:10] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 09:52:10] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-16 09:52:10] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-16 09:52:10] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 74/74 places, 139/139 transitions.
Graph (trivial) has 78 edges and 74 vertex of which 8 / 74 are part of one of the 4 SCC in 11 ms
Free SCC test removed 4 places
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 308 edges and 70 vertex of which 67 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 67 transition count 122
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 66 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 66 transition count 120
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 65 transition count 120
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 19 place count 53 transition count 97
Iterating global reduction 2 with 12 rules applied. Total rules applied 31 place count 53 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 53 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 51 transition count 89
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 51 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 42 place count 51 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 50 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 50 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 45 place count 49 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 49 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 49 place count 49 transition count 78
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 5 with 4 rules applied. Total rules applied 53 place count 47 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 63 place count 42 transition count 112
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 66 place count 42 transition count 109
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 70 place count 42 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 74 place count 38 transition count 105
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 76 place count 38 transition count 103
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 77 place count 38 transition count 216
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 79 place count 37 transition count 215
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 82 place count 37 transition count 212
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 83 place count 36 transition count 172
Iterating global reduction 7 with 1 rules applied. Total rules applied 84 place count 36 transition count 172
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 85 place count 35 transition count 170
Iterating global reduction 7 with 1 rules applied. Total rules applied 86 place count 35 transition count 170
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 95 place count 35 transition count 161
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 101 place count 35 transition count 155
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 112 place count 35 transition count 155
Applied a total of 112 rules in 123 ms. Remains 35 /74 variables (removed 39) and now considering 155/139 (removed -16) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/74 places, 155/139 transitions.
Incomplete random walk after 10000 steps, including 1235 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 215 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 205 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 09:52:10] [INFO ] Flow matrix only has 119 transitions (discarded 36 similar events)
// Phase 1: matrix 119 rows 35 cols
[2022-05-16 09:52:10] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 09:52:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-16 09:52:10] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-16 09:52:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-16 09:52:10] [INFO ] After 15ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:52:10] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:52:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-16 09:52:10] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 09:52:10] [INFO ] After 23ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 09:52:10] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-16 09:52:10] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 155/155 transitions.
Graph (complete) has 199 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 33 transition count 156
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 33 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 32 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 31 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 31 transition count 153
Applied a total of 7 rules in 25 ms. Remains 31 /35 variables (removed 4) and now considering 153/155 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/35 places, 153/155 transitions.
Incomplete random walk after 10000 steps, including 990 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Finished Best-First random walk after 3686 steps, including 68 resets, run visited all 2 properties in 11 ms. (steps per millisecond=335 )
FORMULA HealthRecord-PT-12-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HealthRecord-PT-12-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 4 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(((!p0 U p1)||G(F(G(p2)))))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 139/139 transitions.
Graph (trivial) has 80 edges and 74 vertex of which 8 / 74 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 52 transition count 103
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 52 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 39 place count 52 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 50 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 50 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 46 place count 50 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 49 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 49 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 48 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 48 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 48 transition count 84
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 55 place count 47 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 47 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 45 transition count 101
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 45 transition count 99
Applied a total of 62 rules in 47 ms. Remains 45 /74 variables (removed 29) and now considering 99/139 (removed 40) transitions.
[2022-05-16 09:52:11] [INFO ] Flow matrix only has 89 transitions (discarded 10 similar events)
// Phase 1: matrix 89 rows 45 cols
[2022-05-16 09:52:11] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:52:11] [INFO ] Implicit Places using invariants in 79 ms returned []
[2022-05-16 09:52:11] [INFO ] Flow matrix only has 89 transitions (discarded 10 similar events)
// Phase 1: matrix 89 rows 45 cols
[2022-05-16 09:52:11] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-16 09:52:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 09:52:11] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2022-05-16 09:52:11] [INFO ] Redundant transitions in 41 ms returned []
[2022-05-16 09:52:11] [INFO ] Flow matrix only has 89 transitions (discarded 10 similar events)
// Phase 1: matrix 89 rows 45 cols
[2022-05-16 09:52:11] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-16 09:52:11] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/74 places, 99/139 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/74 places, 99/139 transitions.
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) p0), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s29 0) (EQ s25 1)), p1:(OR (EQ s25 0) (EQ s29 1)), p0:(OR (EQ s20 0) (EQ s38 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 557 ms.
Product exploration explored 100000 steps with 0 reset in 302 ms.
Computed a total of 12 stabilizing places and 30 stable transitions
Computed a total of 12 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 598 ms. Reduced automaton from 2 states, 10 edges and 3 AP to 2 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 947 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1102362 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :{0=1, 1=1, 2=1, 4=1}
Probabilistic random walk after 1102362 steps, saw 134789 distinct states, run finished after 3002 ms. (steps per millisecond=367 ) properties seen :4
Running SMT prover for 2 properties.
[2022-05-16 09:52:17] [INFO ] Flow matrix only has 89 transitions (discarded 10 similar events)
// Phase 1: matrix 89 rows 45 cols
[2022-05-16 09:52:17] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:52:17] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:52:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-05-16 09:52:17] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:52:17] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0))), (F (OR (AND p1 p2) (AND p2 (NOT p0)))), (F (AND (NOT p1) p2 p0)), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 15 factoid took 957 ms. Reduced automaton from 2 states, 10 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[false, false]
Stuttering acceptance computed with spot in 103 ms :[false, false]
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 45 /45 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2022-05-16 09:52:19] [INFO ] Flow matrix only has 89 transitions (discarded 10 similar events)
// Phase 1: matrix 89 rows 45 cols
[2022-05-16 09:52:19] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:52:19] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-05-16 09:52:19] [INFO ] Flow matrix only has 89 transitions (discarded 10 similar events)
// Phase 1: matrix 89 rows 45 cols
[2022-05-16 09:52:19] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 09:52:19] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 09:52:19] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-05-16 09:52:19] [INFO ] Redundant transitions in 40 ms returned []
[2022-05-16 09:52:19] [INFO ] Flow matrix only has 89 transitions (discarded 10 similar events)
// Phase 1: matrix 89 rows 45 cols
[2022-05-16 09:52:19] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-16 09:52:19] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 99/99 transitions.
Computed a total of 12 stabilizing places and 30 stable transitions
Computed a total of 12 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p1 (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 506 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[false, false]
Incomplete random walk after 10000 steps, including 940 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Finished probabilistic random walk after 103961 steps, run visited all 4 properties in 538 ms. (steps per millisecond=193 )
Probabilistic random walk after 103961 steps, saw 16017 distinct states, run finished after 539 ms. (steps per millisecond=192 ) properties seen :4
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p1 (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (OR (AND (NOT p0) p2) (AND p1 p2))), (F (AND p0 (NOT p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 422 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 75 ms :[false, false]
Stuttering acceptance computed with spot in 79 ms :[false, false]
Stuttering acceptance computed with spot in 82 ms :[false, false]
Product exploration explored 100000 steps with 0 reset in 181 ms.
Product exploration explored 100000 steps with 0 reset in 541 ms.
Built C files in :
/tmp/ltsmin12426263399556408397
[2022-05-16 09:52:22] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2022-05-16 09:52:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:52:22] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2022-05-16 09:52:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:52:22] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2022-05-16 09:52:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 09:52:22] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12426263399556408397
Running compilation step : cd /tmp/ltsmin12426263399556408397;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 683 ms.
Running link step : cd /tmp/ltsmin12426263399556408397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin12426263399556408397;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8173367272959423906.hoa' '--buchi-type=spotba'
LTSmin run took 488 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLCardinality-00 finished in 12657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((G(p0) U (G(p1)&&p2))))))'
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 139/139 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 60 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 60 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 60 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 57 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 57 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 57 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 55 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 55 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 54 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 54 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 49 place count 54 transition count 90
Applied a total of 49 rules in 11 ms. Remains 54 /74 variables (removed 20) and now considering 90/139 (removed 49) transitions.
[2022-05-16 09:52:24] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
// Phase 1: matrix 85 rows 54 cols
[2022-05-16 09:52:24] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 09:52:24] [INFO ] Implicit Places using invariants in 77 ms returned []
[2022-05-16 09:52:24] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
// Phase 1: matrix 85 rows 54 cols
[2022-05-16 09:52:24] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 09:52:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:52:24] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-05-16 09:52:24] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
// Phase 1: matrix 85 rows 54 cols
[2022-05-16 09:52:24] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 09:52:24] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/74 places, 90/139 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/74 places, 90/139 transitions.
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p2 p1) p0), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s3 0) (EQ s44 1) (NOT (OR (EQ s14 0) (EQ s28 1)))), p1:(OR (EQ s3 0) (EQ s44 1)), p0:(OR (EQ s18 0) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 277 ms.
Product exploration explored 100000 steps with 3 reset in 326 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X (OR (AND p2 p1) p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 401 ms. Reduced automaton from 8 states, 22 edges and 3 AP to 8 states, 22 edges and 3 AP.
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 721 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Finished Best-First random walk after 1600 steps, including 14 resets, run visited all 3 properties in 9 ms. (steps per millisecond=177 )
Knowledge obtained : [(AND p2 p1 p0), (X (X (OR (AND p2 p1) p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0))))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1 p2)), (F (NOT (AND p0 p1 p2))), (F (NOT p1)), (F (NOT (OR p0 (AND p1 p2)))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 769 ms. Reduced automaton from 8 states, 22 edges and 3 AP to 8 states, 22 edges and 3 AP.
Stuttering acceptance computed with spot in 495 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2022-05-16 09:52:28] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
// Phase 1: matrix 85 rows 54 cols
[2022-05-16 09:52:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 09:52:28] [INFO ] Implicit Places using invariants in 76 ms returned []
[2022-05-16 09:52:28] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
// Phase 1: matrix 85 rows 54 cols
[2022-05-16 09:52:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 09:52:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:52:28] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2022-05-16 09:52:28] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
// Phase 1: matrix 85 rows 54 cols
[2022-05-16 09:52:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 09:52:28] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 90/90 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (OR p0 (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 402 ms. Reduced automaton from 8 states, 22 edges and 3 AP to 8 states, 22 edges and 3 AP.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 726 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 11) seen :8
Finished Best-First random walk after 6077 steps, including 53 resets, run visited all 3 properties in 17 ms. (steps per millisecond=357 )
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (OR p0 (AND p1 p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p1 p2 (NOT p0))), (F (NOT (AND p1 p2 p0))), (F (NOT p1)), (F (NOT (OR (AND p1 p2) p0))), (F (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 496 ms. Reduced automaton from 8 states, 22 edges and 3 AP to 8 states, 22 edges and 3 AP.
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 277 ms.
Product exploration explored 100000 steps with 0 reset in 309 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 492 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 90/90 transitions.
Graph (trivial) has 44 edges and 54 vertex of which 8 / 54 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 49 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 49 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 49 transition count 83
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 49 transition count 125
Deduced a syphon composed of 5 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 49 transition count 124
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 10 rules in 20 ms. Remains 49 /54 variables (removed 5) and now considering 124/90 (removed -34) transitions.
[2022-05-16 09:52:33] [INFO ] Redundant transitions in 41 ms returned []
[2022-05-16 09:52:33] [INFO ] Flow matrix only has 107 transitions (discarded 17 similar events)
// Phase 1: matrix 107 rows 49 cols
[2022-05-16 09:52:33] [INFO ] Computed 11 place invariants in 12 ms
[2022-05-16 09:52:33] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/54 places, 124/90 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/54 places, 124/90 transitions.
Product exploration explored 100000 steps with 1 reset in 298 ms.
Product exploration explored 100000 steps with 0 reset in 204 ms.
Built C files in :
/tmp/ltsmin12051262834610558211
[2022-05-16 09:52:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12051262834610558211
Running compilation step : cd /tmp/ltsmin12051262834610558211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 356 ms.
Running link step : cd /tmp/ltsmin12051262834610558211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12051262834610558211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1833463490561331261.hoa' '--buchi-type=spotba'
LTSmin run took 171 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLCardinality-06 finished in 10294 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||p1)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 139/139 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 56 transition count 106
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 56 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 56 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 53 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 53 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 53 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 51 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 51 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 49 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 49 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 63 place count 49 transition count 77
Applied a total of 63 rules in 10 ms. Remains 49 /74 variables (removed 25) and now considering 77/139 (removed 62) transitions.
[2022-05-16 09:52:34] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
// Phase 1: matrix 73 rows 49 cols
[2022-05-16 09:52:34] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 09:52:34] [INFO ] Implicit Places using invariants in 62 ms returned []
[2022-05-16 09:52:34] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
// Phase 1: matrix 73 rows 49 cols
[2022-05-16 09:52:34] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:52:34] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2022-05-16 09:52:34] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
// Phase 1: matrix 73 rows 49 cols
[2022-05-16 09:52:34] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:52:34] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/74 places, 77/139 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/74 places, 77/139 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s22 1), p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLCardinality-10 finished in 503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(!(p0 U (X(G(p0))||p1))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 139/139 transitions.
Graph (trivial) has 79 edges and 74 vertex of which 8 / 74 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 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 53 transition count 106
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 53 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 36 place count 53 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 50 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 50 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 50 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 48 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 48 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 47 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 47 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 47 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 46 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 46 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 61 place count 44 transition count 97
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 44 transition count 95
Applied a total of 63 rules in 31 ms. Remains 44 /74 variables (removed 30) and now considering 95/139 (removed 44) transitions.
[2022-05-16 09:52:34] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
// Phase 1: matrix 86 rows 44 cols
[2022-05-16 09:52:34] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:52:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-05-16 09:52:34] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
// Phase 1: matrix 86 rows 44 cols
[2022-05-16 09:52:34] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:52:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 09:52:35] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-05-16 09:52:35] [INFO ] Redundant transitions in 34 ms returned []
[2022-05-16 09:52:35] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
// Phase 1: matrix 86 rows 44 cols
[2022-05-16 09:52:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:52:35] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/74 places, 95/139 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/74 places, 95/139 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR p1 p0), p0]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s34 0) (EQ s22 1)), p0:(OR (EQ s5 0) (EQ s41 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 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLCardinality-11 finished in 491 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 139/139 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 56 transition count 107
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 56 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 53 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 53 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 53 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 51 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 51 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 49 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 49 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 63 place count 49 transition count 78
Applied a total of 63 rules in 6 ms. Remains 49 /74 variables (removed 25) and now considering 78/139 (removed 61) transitions.
[2022-05-16 09:52:35] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 49 cols
[2022-05-16 09:52:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:52:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-05-16 09:52:35] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 49 cols
[2022-05-16 09:52:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:52:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:52:35] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-05-16 09:52:35] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 49 cols
[2022-05-16 09:52:35] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:52:35] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/74 places, 78/139 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/74 places, 78/139 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-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:(OR (EQ s47 0) (EQ s25 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 577 ms.
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HealthRecord-PT-12-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-12-LTLCardinality-12 finished in 1345 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(X(G(F(p1)))))||p0)))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 139/139 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 57 transition count 109
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 57 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 57 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 56 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 56 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 55 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 55 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 54 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 54 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 47 place count 54 transition count 95
Applied a total of 47 rules in 3 ms. Remains 54 /74 variables (removed 20) and now considering 95/139 (removed 44) transitions.
[2022-05-16 09:52:36] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
// Phase 1: matrix 92 rows 54 cols
[2022-05-16 09:52:36] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:52:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-05-16 09:52:36] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
// Phase 1: matrix 92 rows 54 cols
[2022-05-16 09:52:36] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:52:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:52:36] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-05-16 09:52:36] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
// Phase 1: matrix 92 rows 54 cols
[2022-05-16 09:52:36] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:52:36] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/74 places, 95/139 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/74 places, 95/139 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s41 1)), p1:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HealthRecord-PT-12-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-12-LTLCardinality-13 finished in 834 ms.
All properties solved by simple procedures.
Total runtime 31356 ms.

BK_STOP 1652694757654

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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