Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.6K Apr 30 11:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 30 11:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 11:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 11:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 67K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652693265859

Running Version 202205111006
[2022-05-16 09:27:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:27:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:27:48] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2022-05-16 09:27:48] [INFO ] Transformed 154 places.
[2022-05-16 09:27:48] [INFO ] Transformed 319 transitions.
[2022-05-16 09:27:48] [INFO ] Found NUPN structural information;
[2022-05-16 09:27:48] [INFO ] Parsed PT model containing 154 places and 319 transitions in 344 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA HealthRecord-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 294/294 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 87 transition count 164
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 87 transition count 164
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 138 place count 83 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 142 place count 83 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 147 place count 83 transition count 151
Applied a total of 147 rules in 35 ms. Remains 83 /154 variables (removed 71) and now considering 151/294 (removed 143) transitions.
[2022-05-16 09:27:48] [INFO ] Flow matrix only has 143 transitions (discarded 8 similar events)
// Phase 1: matrix 143 rows 83 cols
[2022-05-16 09:27:48] [INFO ] Computed 14 place invariants in 14 ms
[2022-05-16 09:27:48] [INFO ] Implicit Places using invariants in 221 ms returned []
[2022-05-16 09:27:48] [INFO ] Flow matrix only has 143 transitions (discarded 8 similar events)
// Phase 1: matrix 143 rows 83 cols
[2022-05-16 09:27:48] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-16 09:27:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:27:49] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2022-05-16 09:27:49] [INFO ] Flow matrix only has 143 transitions (discarded 8 similar events)
// Phase 1: matrix 143 rows 83 cols
[2022-05-16 09:27:49] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 09:27:49] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/154 places, 151/294 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/154 places, 151/294 transitions.
Support contains 31 out of 83 places after structural reductions.
[2022-05-16 09:27:49] [INFO ] Flatten gal took : 63 ms
[2022-05-16 09:27:49] [INFO ] Flatten gal took : 28 ms
[2022-05-16 09:27:49] [INFO ] Input system was already deterministic with 151 transitions.
Support contains 29 out of 83 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 508 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2022-05-16 09:27:51] [INFO ] Flow matrix only has 143 transitions (discarded 8 similar events)
// Phase 1: matrix 143 rows 83 cols
[2022-05-16 09:27:51] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 09:27:51] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 09:27:51] [INFO ] [Real]Absence check using 6 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 09:27:51] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2022-05-16 09:27:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-05-16 09:27:51] [INFO ] [Nat]Absence check using 6 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:27:51] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2022-05-16 09:27:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:27:51] [INFO ] After 101ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :10
[2022-05-16 09:27:52] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :10
Attempting to minimize the solution found.
Minimization took 114 ms.
[2022-05-16 09:27:52] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :10
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 21 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 151/151 transitions.
Graph (trivial) has 66 edges and 83 vertex of which 12 / 83 are part of one of the 6 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 351 edges and 77 vertex of which 74 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 74 transition count 129
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 73 transition count 128
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 5 place count 73 transition count 124
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 16 place count 66 transition count 124
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 61 transition count 114
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 61 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 59 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 59 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 59 transition count 107
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 35 place count 58 transition count 106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 41 place count 55 transition count 127
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 55 transition count 125
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 55 transition count 125
Applied a total of 44 rules in 79 ms. Remains 55 /83 variables (removed 28) and now considering 125/151 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/83 places, 125/151 transitions.
Incomplete random walk after 10000 steps, including 1315 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 422 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 449 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 295 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 125 rows 55 cols
[2022-05-16 09:27:53] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 09:27:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 09:27:53] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 5 ms returned sat
[2022-05-16 09:27:53] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-16 09:27:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 09:27:53] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 4 ms returned sat
[2022-05-16 09:27:54] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-16 09:27:54] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-16 09:27:54] [INFO ] After 63ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-16 09:27:54] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2022-05-16 09:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-16 09:27:54] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2022-05-16 09:27:54] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2022-05-16 09:27:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2022-05-16 09:27:54] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2022-05-16 09:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-05-16 09:27:54] [INFO ] After 425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-05-16 09:27:54] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 19 ms.
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 125/125 transitions.
Graph (trivial) has 45 edges and 55 vertex of which 2 / 55 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 253 edges and 54 vertex of which 42 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 42 transition count 91
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 35 transition count 83
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 35 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 32 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 32 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 30 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 30 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 25 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 25 transition count 66
Applied a total of 68 rules in 16 ms. Remains 25 /55 variables (removed 30) and now considering 66/125 (removed 59) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/55 places, 66/125 transitions.
Incomplete random walk after 10000 steps, including 1829 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 356 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 349 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 09:27:54] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
// Phase 1: matrix 57 rows 25 cols
[2022-05-16 09:27:54] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 09:27:54] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-16 09:27:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 09:27:54] [INFO ] After 13ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:27:54] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:27:55] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 09:27:55] [INFO ] After 12ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 09:27:55] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-16 09:27:55] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25/25 places, 66/66 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 24 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 23 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 23 transition count 60
Applied a total of 7 rules in 19 ms. Remains 23 /25 variables (removed 2) and now considering 60/66 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/25 places, 60/66 transitions.
Finished random walk after 3552 steps, including 633 resets, run visited all 2 properties in 48 ms. (steps per millisecond=74 )
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
FORMULA HealthRecord-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 7 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(G(X(X(p0)))))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 151/151 transitions.
Graph (trivial) has 100 edges and 83 vertex of which 14 / 83 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 52 transition count 102
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 52 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 48 place count 52 transition count 101
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 48 transition count 93
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 48 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 45 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 45 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 42 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 42 transition count 78
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 77 place count 42 transition count 69
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 79 place count 41 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 41 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 39 transition count 83
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 39 transition count 81
Applied a total of 86 rules in 43 ms. Remains 39 /83 variables (removed 44) and now considering 81/151 (removed 70) transitions.
[2022-05-16 09:27:55] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
// Phase 1: matrix 69 rows 39 cols
[2022-05-16 09:27:55] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:27:55] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-05-16 09:27:55] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
// Phase 1: matrix 69 rows 39 cols
[2022-05-16 09:27:55] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 09:27:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-16 09:27:55] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2022-05-16 09:27:55] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-16 09:27:55] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
// Phase 1: matrix 69 rows 39 cols
[2022-05-16 09:27:55] [INFO ] Computed 9 place invariants in 6 ms
[2022-05-16 09:27:55] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/83 places, 81/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/83 places, 81/151 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-06-LTLCardinality-00 finished in 629 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((X(p2)&&p1)||p0))))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 151/151 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 64 transition count 117
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 64 transition count 117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 59 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 59 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 59 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 57 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 57 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 56 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 56 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 56 transition count 94
Applied a total of 59 rules in 13 ms. Remains 56 /83 variables (removed 27) and now considering 94/151 (removed 57) transitions.
[2022-05-16 09:27:56] [INFO ] Flow matrix only has 90 transitions (discarded 4 similar events)
// Phase 1: matrix 90 rows 56 cols
[2022-05-16 09:27:56] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:27:56] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-05-16 09:27:56] [INFO ] Flow matrix only has 90 transitions (discarded 4 similar events)
// Phase 1: matrix 90 rows 56 cols
[2022-05-16 09:27:56] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 09:27:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:27:56] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2022-05-16 09:27:56] [INFO ] Flow matrix only has 90 transitions (discarded 4 similar events)
// Phase 1: matrix 90 rows 56 cols
[2022-05-16 09:27:56] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:27:56] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/83 places, 94/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/83 places, 94/151 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s9 1)), p1:(AND (EQ s33 0) (EQ s14 1)), p2:(OR (EQ s1 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 516 ms.
Product exploration explored 100000 steps with 2 reset in 238 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 569 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 166 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 497 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 09:27:58] [INFO ] Flow matrix only has 90 transitions (discarded 4 similar events)
// Phase 1: matrix 90 rows 56 cols
[2022-05-16 09:27:58] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:27:58] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:27:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 09:27:58] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 11 ms returned sat
[2022-05-16 09:27:58] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X p0)), (G (NOT (AND p1 p2 (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p2 p0))), (F (OR (AND (NOT p1) (NOT p0)) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 796 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 56 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2022-05-16 09:27:59] [INFO ] Flow matrix only has 90 transitions (discarded 4 similar events)
// Phase 1: matrix 90 rows 56 cols
[2022-05-16 09:27:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:27:59] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-05-16 09:27:59] [INFO ] Flow matrix only has 90 transitions (discarded 4 similar events)
// Phase 1: matrix 90 rows 56 cols
[2022-05-16 09:27:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:28:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:28:00] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2022-05-16 09:28:00] [INFO ] Flow matrix only has 90 transitions (discarded 4 similar events)
// Phase 1: matrix 90 rows 56 cols
[2022-05-16 09:28:00] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 09:28:00] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/56 places, 94/94 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 497 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1016 steps, run visited all 1 properties in 22 ms. (steps per millisecond=46 )
Probabilistic random walk after 1016 steps, saw 459 distinct states, run finished after 22 ms. (steps per millisecond=46 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 263 ms.
Product exploration explored 100000 steps with 1 reset in 104 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 94/94 transitions.
Graph (trivial) has 56 edges and 56 vertex of which 12 / 56 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 46 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 46 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 46 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 44 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 44 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 17 place count 44 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 43 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 43 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 43 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 43 transition count 112
Deduced a syphon composed of 5 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 43 transition count 110
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 29 rules in 38 ms. Remains 43 /56 variables (removed 13) and now considering 110/94 (removed -16) transitions.
[2022-05-16 09:28:02] [INFO ] Redundant transitions in 42 ms returned []
[2022-05-16 09:28:02] [INFO ] Flow matrix only has 98 transitions (discarded 12 similar events)
// Phase 1: matrix 98 rows 43 cols
[2022-05-16 09:28:02] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-16 09:28:02] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/56 places, 110/94 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/56 places, 110/94 transitions.
Product exploration explored 100000 steps with 2 reset in 72 ms.
Product exploration explored 100000 steps with 0 reset in 130 ms.
Built C files in :
/tmp/ltsmin13667805790957230323
[2022-05-16 09:28:02] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13667805790957230323
Running compilation step : cd /tmp/ltsmin13667805790957230323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 552 ms.
Running link step : cd /tmp/ltsmin13667805790957230323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin13667805790957230323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11674638587694504010.hoa' '--buchi-type=spotba'
LTSmin run took 5565 ms.
FORMULA HealthRecord-PT-06-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-06-LTLCardinality-02 finished in 12596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 151/151 transitions.
Graph (trivial) has 99 edges and 83 vertex of which 14 / 83 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 53 transition count 103
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 53 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 46 place count 53 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 50 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 50 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 50 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 48 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 48 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 46 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 46 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 69 place count 46 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 45 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 45 transition count 75
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 76 place count 43 transition count 94
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 43 transition count 92
Applied a total of 78 rules in 26 ms. Remains 43 /83 variables (removed 40) and now considering 92/151 (removed 59) transitions.
[2022-05-16 09:28:08] [INFO ] Flow matrix only has 79 transitions (discarded 13 similar events)
// Phase 1: matrix 79 rows 43 cols
[2022-05-16 09:28:08] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:28:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2022-05-16 09:28:08] [INFO ] Flow matrix only has 79 transitions (discarded 13 similar events)
// Phase 1: matrix 79 rows 43 cols
[2022-05-16 09:28:08] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-16 09:28:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-16 09:28:08] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2022-05-16 09:28:08] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-16 09:28:08] [INFO ] Flow matrix only has 79 transitions (discarded 13 similar events)
// Phase 1: matrix 79 rows 43 cols
[2022-05-16 09:28:08] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 09:28:08] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/83 places, 92/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/83 places, 92/151 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s14 0) (EQ s30 1) (OR (EQ s33 0) (EQ s33 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-06-LTLCardinality-05 finished in 338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 151/151 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 60 transition count 110
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 60 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 60 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 56 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 56 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 54 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 54 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 52 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 52 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 52 transition count 82
Applied a total of 72 rules in 8 ms. Remains 52 /83 variables (removed 31) and now considering 82/151 (removed 69) transitions.
[2022-05-16 09:28:08] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 52 cols
[2022-05-16 09:28:08] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:28:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-05-16 09:28:08] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 52 cols
[2022-05-16 09:28:08] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:28:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:28:09] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-05-16 09:28:09] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 52 cols
[2022-05-16 09:28:09] [INFO ] Computed 9 place invariants in 4 ms
[2022-05-16 09:28:09] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/83 places, 82/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/83 places, 82/151 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-07 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 (NEQ s40 0) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-06-LTLCardinality-07 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 151/151 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 61 transition count 112
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 61 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 61 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 56 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 56 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 54 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 54 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 52 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 52 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 52 transition count 82
Applied a total of 72 rules in 7 ms. Remains 52 /83 variables (removed 31) and now considering 82/151 (removed 69) transitions.
[2022-05-16 09:28:09] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 52 cols
[2022-05-16 09:28:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:28:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-05-16 09:28:09] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 52 cols
[2022-05-16 09:28:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:28:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:28:09] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2022-05-16 09:28:09] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 52 cols
[2022-05-16 09:28:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:28:09] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/83 places, 82/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/83 places, 82/151 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s3 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 70 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 496 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 77419 steps, run visited all 1 properties in 197 ms. (steps per millisecond=392 )
Probabilistic random walk after 77419 steps, saw 11911 distinct states, run finished after 197 ms. (steps per millisecond=392 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2022-05-16 09:28:10] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 52 cols
[2022-05-16 09:28:10] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-16 09:28:10] [INFO ] Implicit Places using invariants in 62 ms returned []
[2022-05-16 09:28:10] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 52 cols
[2022-05-16 09:28:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:28:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:28:11] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2022-05-16 09:28:11] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 52 cols
[2022-05-16 09:28:11] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:28:11] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/52 places, 82/82 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 506 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 77419 steps, run visited all 1 properties in 168 ms. (steps per millisecond=460 )
Probabilistic random walk after 77419 steps, saw 11911 distinct states, run finished after 169 ms. (steps per millisecond=458 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 66 ms.
Product exploration explored 100000 steps with 1 reset in 73 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Graph (trivial) has 50 edges and 52 vertex of which 14 / 52 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 44 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 44 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 44 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 44 transition count 120
Deduced a syphon composed of 5 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 44 transition count 118
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 29 ms. Remains 44 /52 variables (removed 8) and now considering 118/82 (removed -36) transitions.
[2022-05-16 09:28:12] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-16 09:28:12] [INFO ] Flow matrix only has 106 transitions (discarded 12 similar events)
// Phase 1: matrix 106 rows 44 cols
[2022-05-16 09:28:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:28:12] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/52 places, 118/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/52 places, 118/82 transitions.
Product exploration explored 100000 steps with 1 reset in 52 ms.
Product exploration explored 100000 steps with 0 reset in 58 ms.
Built C files in :
/tmp/ltsmin13630018108042992182
[2022-05-16 09:28:12] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13630018108042992182
Running compilation step : cd /tmp/ltsmin13630018108042992182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 316 ms.
Running link step : cd /tmp/ltsmin13630018108042992182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13630018108042992182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12199468515621590767.hoa' '--buchi-type=spotba'
LTSmin run took 4219 ms.
FORMULA HealthRecord-PT-06-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-06-LTLCardinality-10 finished in 8314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 151/151 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 62 transition count 113
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 62 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 62 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 58 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 58 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 58 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 56 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 56 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 54 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 54 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 54 transition count 85
Applied a total of 68 rules in 5 ms. Remains 54 /83 variables (removed 29) and now considering 85/151 (removed 66) transitions.
[2022-05-16 09:28:17] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 54 cols
[2022-05-16 09:28:17] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:28:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-05-16 09:28:17] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 54 cols
[2022-05-16 09:28:17] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 09:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:28:17] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2022-05-16 09:28:17] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 54 cols
[2022-05-16 09:28:17] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:28:17] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/83 places, 85/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/83 places, 85/151 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s25 0) (EQ s34 1)), p1:(OR (EQ s41 0) (EQ s7 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 63 ms.
Product exploration explored 100000 steps with 2 reset in 74 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 299 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 498 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 748 steps, run visited all 1 properties in 11 ms. (steps per millisecond=68 )
Probabilistic random walk after 748 steps, saw 369 distinct states, run finished after 11 ms. (steps per millisecond=68 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 317 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 85/85 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2022-05-16 09:28:19] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 54 cols
[2022-05-16 09:28:19] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:28:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-16 09:28:19] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 54 cols
[2022-05-16 09:28:19] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 09:28:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:28:19] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-16 09:28:19] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 54 cols
[2022-05-16 09:28:19] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 09:28:19] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 85/85 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 500 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 748 steps, run visited all 1 properties in 8 ms. (steps per millisecond=93 )
Probabilistic random walk after 748 steps, saw 369 distinct states, run finished after 8 ms. (steps per millisecond=93 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 72 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 85/85 transitions.
Graph (trivial) has 53 edges and 54 vertex of which 14 / 54 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 45 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 45 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 44 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 44 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 43 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 43 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 42 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 42 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 42 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 42 transition count 109
Deduced a syphon composed of 5 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 42 transition count 106
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 22 rules in 15 ms. Remains 42 /54 variables (removed 12) and now considering 106/85 (removed -21) transitions.
[2022-05-16 09:28:20] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-16 09:28:20] [INFO ] Flow matrix only has 93 transitions (discarded 13 similar events)
// Phase 1: matrix 93 rows 42 cols
[2022-05-16 09:28:20] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 09:28:20] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/54 places, 106/85 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/54 places, 106/85 transitions.
Product exploration explored 100000 steps with 1 reset in 54 ms.
Product exploration explored 100000 steps with 1 reset in 63 ms.
Built C files in :
/tmp/ltsmin10225825778821726725
[2022-05-16 09:28:20] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10225825778821726725
Running compilation step : cd /tmp/ltsmin10225825778821726725;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 231 ms.
Running link step : cd /tmp/ltsmin10225825778821726725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10225825778821726725;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12482686499442417825.hoa' '--buchi-type=spotba'
LTSmin run took 3265 ms.
FORMULA HealthRecord-PT-06-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-06-LTLCardinality-12 finished in 6618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(F(!p0) U X(X(p1))))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 151/151 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 62 transition count 114
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 62 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 62 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 58 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 58 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 58 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 56 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 56 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 55 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 55 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 55 transition count 92
Applied a total of 62 rules in 4 ms. Remains 55 /83 variables (removed 28) and now considering 92/151 (removed 59) transitions.
[2022-05-16 09:28:24] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 55 cols
[2022-05-16 09:28:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:28:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2022-05-16 09:28:24] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 55 cols
[2022-05-16 09:28:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:28:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:28:24] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2022-05-16 09:28:24] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 55 cols
[2022-05-16 09:28:24] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 09:28:24] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/83 places, 92/151 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/83 places, 92/151 transitions.
Stuttering acceptance computed with spot in 449 ms :[p1, p1, p1, (AND (NOT p0) p1), p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : HealthRecord-PT-06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0, 1} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0, 1} source=2 dest: 4}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={1} source=3 dest: 7}], [{ cond=p1, acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 1}, { cond=p1, acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={1} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={0, 1} source=7 dest: 4}, { cond=(NOT p0), acceptance={0} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 6}, { cond=p0, acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=8 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1), acceptance={1} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s39 0) (EQ s3 1)), p1:(OR (EQ s41 0) (EQ s30 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 279 ms. Reduced automaton from 9 states, 29 edges and 2 AP to 9 states, 29 edges and 2 AP.
Stuttering acceptance computed with spot in 475 ms :[p1, p1, p1, (AND (NOT p0) p1), p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 502 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 09:28:26] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 55 cols
[2022-05-16 09:28:26] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 09:28:26] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 09:28:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-16 09:28:26] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 09:28:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:28:26] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 09:28:26] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-16 09:28:26] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 92/92 transitions.
Graph (trivial) has 51 edges and 55 vertex of which 14 / 55 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 184 edges and 48 vertex of which 30 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 30 transition count 47
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 22 place count 30 transition count 44
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 27 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 26 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 26 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 25 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 24 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 24 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 24 transition count 40
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 2 with 6 rules applied. Total rules applied 41 place count 21 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 21 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 20 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 19 transition count 35
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 48 place count 19 transition count 31
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 50 place count 18 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 17 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 17 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 17 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 17 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 16 transition count 26
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 16 transition count 25
Applied a total of 58 rules in 13 ms. Remains 16 /55 variables (removed 39) and now considering 25/92 (removed 67) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/55 places, 25/92 transitions.
Finished random walk after 22 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 356 ms. Reduced automaton from 9 states, 29 edges and 2 AP to 9 states, 29 edges and 2 AP.
Stuttering acceptance computed with spot in 352 ms :[p1, p1, p1, (AND (NOT p0) p1), p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 350 ms :[p1, p1, p1, (AND (NOT p0) p1), p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2022-05-16 09:28:27] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 55 cols
[2022-05-16 09:28:27] [INFO ] Computed 9 place invariants in 0 ms
Proved EG p1
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (NOT p1)), (G p1)]
Property proved to be false thanks to negative knowledge :(G p1)
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 9 states, 29 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA HealthRecord-PT-06-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-06-LTLCardinality-14 finished in 3429 ms.
All properties solved by simple procedures.
Total runtime 39688 ms.

BK_STOP 1652693307776

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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