MCC'2023- Execution of r199-smll-167840345800347

About the Execution of LoLa+red for HealthRecord-PT-15

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
450.039	36338.00	74102.00	620.20	TFFFFFFFFFFTFFFF	normal

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.r199-smll-167840345800347.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 lolaxred
Input is HealthRecord-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345800347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 17:58 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 73K 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-15-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678521041288

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 07:50:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 07:50:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:50:45] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-11 07:50:45] [INFO ] Transformed 163 places.
[2023-03-11 07:50:45] [INFO ] Transformed 348 transitions.
[2023-03-11 07:50:45] [INFO ] Found NUPN structural information;
[2023-03-11 07:50:45] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
FORMULA HealthRecord-PT-15-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 319/319 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 96 transition count 192
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 96 transition count 192
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 137 place count 93 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 140 place count 93 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 143 place count 93 transition count 183
Applied a total of 143 rules in 80 ms. Remains 93 /163 variables (removed 70) and now considering 183/319 (removed 136) transitions.
[2023-03-11 07:50:45] [INFO ] Flow matrix only has 178 transitions (discarded 5 similar events)
// Phase 1: matrix 178 rows 93 cols
[2023-03-11 07:50:45] [INFO ] Computed 11 place invariants in 16 ms
[2023-03-11 07:50:45] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-11 07:50:45] [INFO ] Flow matrix only has 178 transitions (discarded 5 similar events)
[2023-03-11 07:50:45] [INFO ] Invariant cache hit.
[2023-03-11 07:50:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:46] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2023-03-11 07:50:46] [INFO ] Flow matrix only has 178 transitions (discarded 5 similar events)
[2023-03-11 07:50:46] [INFO ] Invariant cache hit.
[2023-03-11 07:50:46] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/163 places, 183/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1007 ms. Remains : 93/163 places, 183/319 transitions.
Support contains 35 out of 93 places after structural reductions.
[2023-03-11 07:50:46] [INFO ] Flatten gal took : 88 ms
[2023-03-11 07:50:46] [INFO ] Flatten gal took : 39 ms
[2023-03-11 07:50:47] [INFO ] Input system was already deterministic with 183 transitions.
Support contains 33 out of 93 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 927 resets, run finished after 826 ms. (steps per millisecond=12 ) properties (out of 20) seen :5
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-11 07:50:48] [INFO ] Flow matrix only has 178 transitions (discarded 5 similar events)
[2023-03-11 07:50:48] [INFO ] Invariant cache hit.
[2023-03-11 07:50:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-11 07:50:48] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-11 07:50:48] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 07:50:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-11 07:50:48] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-11 07:50:48] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-11 07:50:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:49] [INFO ] After 215ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-11 07:50:49] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 9 ms to minimize.
[2023-03-11 07:50:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-11 07:50:49] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2023-03-11 07:50:49] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2023-03-11 07:50:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2023-03-11 07:50:49] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2023-03-11 07:50:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-11 07:50:49] [INFO ] After 1015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-11 07:50:50] [INFO ] After 1784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 23 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 183/183 transitions.
Graph (trivial) has 74 edges and 93 vertex of which 4 / 93 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 384 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 11 place count 80 transition count 155
Iterating global reduction 0 with 9 rules applied. Total rules applied 20 place count 80 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 79 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 153
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 76 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 76 transition count 149
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 41 place count 70 transition count 189
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 70 transition count 187
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 70 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 68 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 68 transition count 185
Applied a total of 48 rules in 105 ms. Remains 68 /93 variables (removed 25) and now considering 185/183 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 68/93 places, 185/183 transitions.
Incomplete random walk after 10000 steps, including 1811 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 278 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 294 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 294 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 271 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 278 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 274 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 268 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 273 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :1
Running SMT prover for 10 properties.
[2023-03-11 07:50:51] [INFO ] Flow matrix only has 168 transitions (discarded 17 similar events)
// Phase 1: matrix 168 rows 68 cols
[2023-03-11 07:50:51] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 07:50:51] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 07:50:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 07:50:51] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 07:50:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 07:50:52] [INFO ] After 107ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-11 07:50:52] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-03-11 07:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-11 07:50:52] [INFO ] After 372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-11 07:50:52] [INFO ] After 774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 16 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 185/185 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 65 transition count 179
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 65 transition count 179
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 63 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 63 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 63 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 61 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 61 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 60 transition count 170
Applied a total of 20 rules in 38 ms. Remains 60 /68 variables (removed 8) and now considering 170/185 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 60/68 places, 170/185 transitions.
Incomplete random walk after 10000 steps, including 1810 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 268 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 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 293 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 266 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 270 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Finished probabilistic random walk after 16906 steps, run visited all 10 properties in 114 ms. (steps per millisecond=148 )
Probabilistic random walk after 16906 steps, saw 3757 distinct states, run finished after 114 ms. (steps per millisecond=148 ) properties seen :10
Computed a total of 9 stabilizing places and 14 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' '!(F((p0&&X((p1&&X((p1 U (X(p2)||G(p1)))))))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 66 transition count 131
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 66 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 66 transition count 129
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 60 transition count 117
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 60 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 60 transition count 114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 57 transition count 105
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 57 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 55 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 55 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 87 place count 55 transition count 95
Applied a total of 87 rules in 18 ms. Remains 55 /93 variables (removed 38) and now considering 95/183 (removed 88) transitions.
[2023-03-11 07:50:53] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
// Phase 1: matrix 92 rows 55 cols
[2023-03-11 07:50:53] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-11 07:50:53] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-11 07:50:53] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:50:53] [INFO ] Invariant cache hit.
[2023-03-11 07:50:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:54] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-11 07:50:54] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:50:54] [INFO ] Invariant cache hit.
[2023-03-11 07:50:54] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/93 places, 95/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 352 ms. Remains : 55/93 places, 95/183 transitions.
Stuttering acceptance computed with spot in 624 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 2}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s44 1)), p1:(NEQ s13 1), p2:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 642 ms.
Product exploration explored 100000 steps with 25000 reset in 318 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 565 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 919 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 121 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 07:50:57] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:50:57] [INFO ] Invariant cache hit.
[2023-03-11 07:50:57] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-11 07:50:57] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-11 07:50:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:57] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 07:50:57] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 07:50:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 07:50:57] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 07:50:57] [INFO ] After 61ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 07:50:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-03-11 07:50:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-11 07:50:57] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-11 07:50:57] [INFO ] After 404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 95/95 transitions.
Graph (trivial) has 45 edges and 55 vertex of which 6 / 55 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 194 edges and 52 vertex of which 38 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 38 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 25 place count 38 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 37 place count 32 transition count 53
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 27 transition count 40
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 27 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 26 transition count 39
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 26 transition count 39
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 25 transition count 38
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 25 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 25 transition count 37
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 21 transition count 33
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 21 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 20 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 19 transition count 30
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 19 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 18 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 17 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 17 transition count 25
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 17 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 16 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 16 transition count 21
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 16 transition count 20
Applied a total of 78 rules in 28 ms. Remains 16 /55 variables (removed 39) and now considering 20/95 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 16/55 places, 20/95 transitions.
Finished random walk after 7173 steps, including 1298 resets, run visited all 5 properties in 91 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 9 factoid took 858 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-11 07:50:59] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:50:59] [INFO ] Invariant cache hit.
[2023-03-11 07:50:59] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 07:50:59] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:50:59] [INFO ] Invariant cache hit.
[2023-03-11 07:50:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:59] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-11 07:50:59] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:50:59] [INFO ] Invariant cache hit.
[2023-03-11 07:50:59] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 55/55 places, 95/95 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 651 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 912 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 126 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 07:51:01] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:51:01] [INFO ] Invariant cache hit.
[2023-03-11 07:51:01] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 07:51:01] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-11 07:51:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:01] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 07:51:01] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 07:51:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 07:51:01] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 07:51:01] [INFO ] After 57ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 07:51:02] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2023-03-11 07:51:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-11 07:51:02] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-11 07:51:02] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 95/95 transitions.
Graph (trivial) has 45 edges and 55 vertex of which 6 / 55 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 194 edges and 52 vertex of which 38 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 38 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 25 place count 38 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 37 place count 32 transition count 53
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 27 transition count 40
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 27 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 26 transition count 39
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 26 transition count 39
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 25 transition count 38
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 25 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 25 transition count 37
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 21 transition count 33
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 21 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 20 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 19 transition count 30
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 19 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 18 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 17 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 17 transition count 25
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 17 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 16 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 16 transition count 21
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 16 transition count 20
Applied a total of 78 rules in 22 ms. Remains 16 /55 variables (removed 39) and now considering 20/95 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 16/55 places, 20/95 transitions.
Incomplete random walk after 10000 steps, including 1887 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :6
Finished Best-First random walk after 314 steps, including 17 resets, run visited all 1 properties in 1 ms. (steps per millisecond=314 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 9 factoid took 745 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 318 ms.
Product exploration explored 100000 steps with 25000 reset in 384 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-11 07:51:05] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:51:05] [INFO ] Invariant cache hit.
[2023-03-11 07:51:05] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-11 07:51:05] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:51:05] [INFO ] Invariant cache hit.
[2023-03-11 07:51:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:05] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-11 07:51:05] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2023-03-11 07:51:05] [INFO ] Invariant cache hit.
[2023-03-11 07:51:05] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 55/55 places, 95/95 transitions.
Treatment of property HealthRecord-PT-15-LTLCardinality-00 finished in 11627 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((p0||(!p1 U (G(!p1)||(!p1&&G(!p2))))))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Graph (trivial) has 107 edges and 93 vertex of which 6 / 93 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 64 transition count 131
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 64 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 53 place count 64 transition count 129
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 60 transition count 121
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 60 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 59 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 59 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 58 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 58 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 58 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 57 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 57 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 56 transition count 121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 56 transition count 120
Applied a total of 74 rules in 50 ms. Remains 56 /93 variables (removed 37) and now considering 120/183 (removed 63) transitions.
[2023-03-11 07:51:05] [INFO ] Flow matrix only has 115 transitions (discarded 5 similar events)
// Phase 1: matrix 115 rows 56 cols
[2023-03-11 07:51:05] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 07:51:05] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-11 07:51:05] [INFO ] Flow matrix only has 115 transitions (discarded 5 similar events)
[2023-03-11 07:51:05] [INFO ] Invariant cache hit.
[2023-03-11 07:51:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-11 07:51:05] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-11 07:51:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-11 07:51:05] [INFO ] Flow matrix only has 115 transitions (discarded 5 similar events)
[2023-03-11 07:51:05] [INFO ] Invariant cache hit.
[2023-03-11 07:51:05] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/93 places, 120/183 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 425 ms. Remains : 56/93 places, 120/183 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s7 0) (EQ s12 1)), p0:(AND (EQ s40 0) (EQ s35 1)), p1:(OR (EQ s31 0) (EQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-01 finished in 635 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((p0 U (p1&&G(p0)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 65 transition count 128
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 65 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 65 transition count 125
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 59 transition count 113
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 59 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 59 transition count 111
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 57 transition count 105
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 57 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 55 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 55 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 87 place count 55 transition count 95
Applied a total of 87 rules in 15 ms. Remains 55 /93 variables (removed 38) and now considering 95/183 (removed 88) transitions.
[2023-03-11 07:51:06] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 55 cols
[2023-03-11 07:51:06] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:51:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 07:51:06] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2023-03-11 07:51:06] [INFO ] Invariant cache hit.
[2023-03-11 07:51:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:06] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-11 07:51:06] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2023-03-11 07:51:06] [INFO ] Invariant cache hit.
[2023-03-11 07:51:06] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/93 places, 95/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 55/93 places, 95/183 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s32 0) (EQ s21 1)), p1:(OR (EQ s10 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 221 ms.
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-02 finished in 736 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(p0)))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Graph (trivial) has 116 edges and 93 vertex of which 6 / 93 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 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 31 place count 59 transition count 121
Iterating global reduction 0 with 30 rules applied. Total rules applied 61 place count 59 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 63 place count 59 transition count 119
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 53 transition count 107
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 53 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 53 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 51 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 51 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 49 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 49 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 92 place count 49 transition count 88
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 94 place count 48 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 48 transition count 86
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 99 place count 46 transition count 105
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 46 transition count 103
Applied a total of 101 rules in 39 ms. Remains 46 /93 variables (removed 47) and now considering 103/183 (removed 80) transitions.
[2023-03-11 07:51:06] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
// Phase 1: matrix 95 rows 46 cols
[2023-03-11 07:51:06] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:06] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 07:51:06] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
[2023-03-11 07:51:06] [INFO ] Invariant cache hit.
[2023-03-11 07:51:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-11 07:51:06] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-11 07:51:07] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-11 07:51:07] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
[2023-03-11 07:51:07] [INFO ] Invariant cache hit.
[2023-03-11 07:51:07] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/93 places, 103/183 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 425 ms. Remains : 46/93 places, 103/183 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s33 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5 reset in 106 ms.
Product exploration explored 100000 steps with 4 reset in 132 ms.
Computed a total of 8 stabilizing places and 22 stable transitions
Computed a total of 8 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 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 83 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1046 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1149515 steps, run visited all 1 properties in 1095 ms. (steps per millisecond=1049 )
Probabilistic random walk after 1149515 steps, saw 142530 distinct states, run finished after 1101 ms. (steps per millisecond=1044 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-11 07:51:09] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
[2023-03-11 07:51:09] [INFO ] Invariant cache hit.
[2023-03-11 07:51:09] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 07:51:09] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
[2023-03-11 07:51:09] [INFO ] Invariant cache hit.
[2023-03-11 07:51:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-11 07:51:09] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-11 07:51:09] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-11 07:51:09] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
[2023-03-11 07:51:09] [INFO ] Invariant cache hit.
[2023-03-11 07:51:09] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 46/46 places, 103/103 transitions.
Computed a total of 8 stabilizing places and 22 stable transitions
Computed a total of 8 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 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 98 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1048 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1149515 steps, run visited all 1 properties in 1192 ms. (steps per millisecond=964 )
Probabilistic random walk after 1149515 steps, saw 142530 distinct states, run finished after 1192 ms. (steps per millisecond=964 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17 reset in 89 ms.
Product exploration explored 100000 steps with 2 reset in 484 ms.
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-11 07:51:11] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
[2023-03-11 07:51:11] [INFO ] Invariant cache hit.
[2023-03-11 07:51:11] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 07:51:11] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
[2023-03-11 07:51:11] [INFO ] Invariant cache hit.
[2023-03-11 07:51:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-11 07:51:12] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-11 07:51:12] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-11 07:51:12] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
[2023-03-11 07:51:12] [INFO ] Invariant cache hit.
[2023-03-11 07:51:12] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 363 ms. Remains : 46/46 places, 103/103 transitions.
Treatment of property HealthRecord-PT-15-LTLCardinality-05 finished in 5581 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(G(p0))))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 64 transition count 127
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 64 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 64 transition count 124
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 58 transition count 112
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 58 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 76 place count 58 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 55 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 55 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 52 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 52 transition count 94
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 97 place count 52 transition count 85
Applied a total of 97 rules in 10 ms. Remains 52 /93 variables (removed 41) and now considering 85/183 (removed 98) transitions.
[2023-03-11 07:51:12] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 52 cols
[2023-03-11 07:51:12] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 07:51:12] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 07:51:12] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2023-03-11 07:51:12] [INFO ] Invariant cache hit.
[2023-03-11 07:51:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:12] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-11 07:51:12] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2023-03-11 07:51:12] [INFO ] Invariant cache hit.
[2023-03-11 07:51:12] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/93 places, 85/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 52/93 places, 85/183 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-07 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}]], initial=3, aps=[p0:(AND (EQ s14 0) (EQ s48 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-07 finished in 482 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(G((p0&&X(p1)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 66 transition count 131
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 66 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 66 transition count 128
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 59 transition count 114
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 59 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 59 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 58 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 58 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 57 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 57 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 57 transition count 103
Applied a total of 81 rules in 6 ms. Remains 57 /93 variables (removed 36) and now considering 103/183 (removed 80) transitions.
[2023-03-11 07:51:12] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
// Phase 1: matrix 100 rows 57 cols
[2023-03-11 07:51:12] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:12] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-11 07:51:12] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2023-03-11 07:51:12] [INFO ] Invariant cache hit.
[2023-03-11 07:51:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:12] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-11 07:51:12] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2023-03-11 07:51:12] [INFO ] Invariant cache hit.
[2023-03-11 07:51:13] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/93 places, 103/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 57/93 places, 103/183 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s39 0) (EQ s28 1)), p1:(OR (EQ s13 0) (EQ s4 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-08 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Graph (trivial) has 114 edges and 93 vertex of which 4 / 93 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 30 place count 61 transition count 124
Iterating global reduction 0 with 29 rules applied. Total rules applied 59 place count 61 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 62 place count 61 transition count 121
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 69 place count 54 transition count 107
Iterating global reduction 1 with 7 rules applied. Total rules applied 76 place count 54 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 54 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 51 transition count 96
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 51 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 48 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 48 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 99 place count 48 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 47 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 45 transition count 94
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 45 transition count 92
Applied a total of 107 rules in 18 ms. Remains 45 /93 variables (removed 48) and now considering 92/183 (removed 91) transitions.
[2023-03-11 07:51:13] [INFO ] Flow matrix only has 85 transitions (discarded 7 similar events)
// Phase 1: matrix 85 rows 45 cols
[2023-03-11 07:51:13] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:51:13] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 07:51:13] [INFO ] Flow matrix only has 85 transitions (discarded 7 similar events)
[2023-03-11 07:51:13] [INFO ] Invariant cache hit.
[2023-03-11 07:51:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 07:51:13] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-11 07:51:13] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 07:51:13] [INFO ] Flow matrix only has 85 transitions (discarded 7 similar events)
[2023-03-11 07:51:13] [INFO ] Invariant cache hit.
[2023-03-11 07:51:13] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/93 places, 92/183 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 45/93 places, 92/183 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s5 0) (EQ s29 1)), p1:(AND (NEQ s29 0) (NEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-10 finished in 434 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(p0))'
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 63 transition count 125
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 63 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 63 transition count 122
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 57 transition count 110
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 57 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 57 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 55 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 53 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 53 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 92 place count 53 transition count 91
Applied a total of 92 rules in 5 ms. Remains 53 /93 variables (removed 40) and now considering 91/183 (removed 92) transitions.
[2023-03-11 07:51:13] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2023-03-11 07:51:13] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 07:51:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-11 07:51:13] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2023-03-11 07:51:13] [INFO ] Invariant cache hit.
[2023-03-11 07:51:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:13] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-11 07:51:13] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2023-03-11 07:51:13] [INFO ] Invariant cache hit.
[2023-03-11 07:51:13] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/93 places, 91/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 53/93 places, 91/183 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s30 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 339 ms.
Product exploration explored 100000 steps with 50000 reset in 433 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-15-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-15-LTLCardinality-11 finished in 1145 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 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 63 transition count 125
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 63 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 63 transition count 122
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 56 transition count 108
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 56 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 56 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 54 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 54 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 52 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 52 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 52 transition count 89
Applied a total of 94 rules in 9 ms. Remains 52 /93 variables (removed 41) and now considering 89/183 (removed 94) transitions.
[2023-03-11 07:51:14] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2023-03-11 07:51:14] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:14] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 07:51:14] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:51:14] [INFO ] Invariant cache hit.
[2023-03-11 07:51:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:14] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-11 07:51:14] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:51:14] [INFO ] Invariant cache hit.
[2023-03-11 07:51:14] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/93 places, 89/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 52/93 places, 89/183 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s12 0) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-13 finished in 294 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((G(!p0)||(!p0&&F(p1)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 65 transition count 129
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 65 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 65 transition count 126
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 58 transition count 112
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 58 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 76 place count 58 transition count 109
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 56 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 56 transition count 103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 54 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 54 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 90 place count 54 transition count 93
Applied a total of 90 rules in 6 ms. Remains 54 /93 variables (removed 39) and now considering 93/183 (removed 90) transitions.
[2023-03-11 07:51:15] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 54 cols
[2023-03-11 07:51:15] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:15] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 07:51:15] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2023-03-11 07:51:15] [INFO ] Invariant cache hit.
[2023-03-11 07:51:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:15] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-11 07:51:15] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2023-03-11 07:51:15] [INFO ] Invariant cache hit.
[2023-03-11 07:51:15] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/93 places, 93/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 54/93 places, 93/183 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p1), p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s4 0) (EQ s10 1)), p0:(OR (EQ s52 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-14 finished in 480 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||F(p1)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 183/183 transitions.
Graph (trivial) has 111 edges and 93 vertex of which 6 / 93 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 28 place count 62 transition count 127
Iterating global reduction 0 with 27 rules applied. Total rules applied 55 place count 62 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 58 place count 62 transition count 124
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 56 transition count 112
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 56 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 72 place count 56 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 54 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 54 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 52 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 52 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 86 place count 52 transition count 94
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 88 place count 51 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 51 transition count 92
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 93 place count 49 transition count 111
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 49 transition count 109
Applied a total of 95 rules in 20 ms. Remains 49 /93 variables (removed 44) and now considering 109/183 (removed 74) transitions.
[2023-03-11 07:51:15] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
// Phase 1: matrix 101 rows 49 cols
[2023-03-11 07:51:15] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:15] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 07:51:15] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
[2023-03-11 07:51:15] [INFO ] Invariant cache hit.
[2023-03-11 07:51:15] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-11 07:51:15] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-11 07:51:15] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-11 07:51:15] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
[2023-03-11 07:51:15] [INFO ] Invariant cache hit.
[2023-03-11 07:51:15] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/93 places, 109/183 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 49/93 places, 109/183 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s13 0) (NEQ s19 1)), p1:(AND (NEQ s35 0) (NEQ s5 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 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-15 finished in 483 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((p0&&X((p1&&X((p1 U (X(p2)||G(p1)))))))))'
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)))'
[2023-03-11 07:51:16] [INFO ] Flatten gal took : 25 ms
[2023-03-11 07:51:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-11 07:51:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 93 places, 183 transitions and 557 arcs took 4 ms.
Total runtime 31610 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HealthRecord-PT-15
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA HealthRecord-PT-15-LTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HealthRecord-PT-15-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678521077626

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 HealthRecord-PT-15-LTLCardinality-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for HealthRecord-PT-15-LTLCardinality-00
lola: result : true
lola: markings : 205
lola: fired transitions : 372
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 HealthRecord-PT-15-LTLCardinality-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for HealthRecord-PT-15-LTLCardinality-05
lola: result : false
lola: markings : 1016
lola: fired transitions : 2082
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HealthRecord-PT-15-LTLCardinality-00: LTL true LTL model checker
HealthRecord-PT-15-LTLCardinality-05: LTL false LTL model checker

Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is HealthRecord-PT-15, 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 r199-smll-167840345800347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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