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.r078-tall-165260110000179.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 DoubleExponent-PT-003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 13:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 50K May 10 09:33 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 DoubleExponent-PT-003-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652639287593

Running Version 202205111006
[2022-05-15 18:28:08] [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-15 18:28:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:28:08] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2022-05-15 18:28:08] [INFO ] Transformed 163 places.
[2022-05-15 18:28:08] [INFO ] Transformed 148 transitions.
[2022-05-15 18:28:08] [INFO ] Parsed PT model containing 163 places and 148 transitions in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DoubleExponent-PT-003-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 148
Applied a total of 3 rules in 22 ms. Remains 160 /163 variables (removed 3) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 160 cols
[2022-05-15 18:28:09] [INFO ] Computed 17 place invariants in 22 ms
[2022-05-15 18:28:09] [INFO ] Implicit Places using invariants in 223 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 249 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/163 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 158 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 147
Applied a total of 2 rules in 14 ms. Remains 158 /159 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 158 cols
[2022-05-15 18:28:09] [INFO ] Computed 16 place invariants in 4 ms
[2022-05-15 18:28:09] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 147 rows 158 cols
[2022-05-15 18:28:09] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-15 18:28:09] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 158/163 places, 147/148 transitions.
Finished structural reductions, in 2 iterations. Remains : 158/163 places, 147/148 transitions.
Support contains 33 out of 158 places after structural reductions.
[2022-05-15 18:28:09] [INFO ] Flatten gal took : 36 ms
[2022-05-15 18:28:09] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:28:09] [INFO ] Input system was already deterministic with 147 transitions.
Incomplete random walk after 10000 steps, including 329 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 20) seen :7
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 147 rows 158 cols
[2022-05-15 18:28:12] [INFO ] Computed 16 place invariants in 8 ms
[2022-05-15 18:28:12] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 18:28:12] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 5 ms returned sat
[2022-05-15 18:28:12] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-15 18:28:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 18:28:13] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 4 ms returned sat
[2022-05-15 18:28:13] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :9
[2022-05-15 18:28:13] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 5 ms to minimize.
[2022-05-15 18:28:13] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2022-05-15 18:28:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2022-05-15 18:28:13] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2022-05-15 18:28:13] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 2 ms to minimize.
[2022-05-15 18:28:13] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2022-05-15 18:28:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 159 ms
[2022-05-15 18:28:13] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2022-05-15 18:28:13] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2022-05-15 18:28:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2022-05-15 18:28:13] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2022-05-15 18:28:13] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2022-05-15 18:28:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2022-05-15 18:28:13] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-05-15 18:28:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2022-05-15 18:28:14] [INFO ] After 922ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :9
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-15 18:28:14] [INFO ] After 1140ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :9
Fused 13 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 172 ms.
Support contains 16 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 155 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 155 transition count 121
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 56 place count 131 transition count 115
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 125 transition count 115
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 62 place count 125 transition count 110
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 72 place count 120 transition count 110
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 120 place count 96 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 94 transition count 86
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 134 place count 94 transition count 76
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 144 place count 84 transition count 76
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 153 place count 84 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 83 transition count 75
Applied a total of 154 rules in 46 ms. Remains 83 /158 variables (removed 75) and now considering 75/147 (removed 72) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/158 places, 75/147 transitions.
Incomplete random walk after 10000 steps, including 897 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10000 steps, including 674 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 653 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 687 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 677 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 663 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 75 rows 83 cols
[2022-05-15 18:28:15] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-15 18:28:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 18:28:15] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-15 18:28:15] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 18:28:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 18:28:15] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-15 18:28:15] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 18:28:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 18:28:15] [INFO ] After 36ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 18:28:15] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-15 18:28:15] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2022-05-15 18:28:15] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2022-05-15 18:28:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
[2022-05-15 18:28:15] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2022-05-15 18:28:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-15 18:28:15] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2022-05-15 18:28:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 18:28:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2022-05-15 18:28:15] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-15 18:28:15] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 27 ms.
Support contains 9 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 75/75 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 83 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 82 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 80 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 79 transition count 73
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 79 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 78 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 78 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 77 transition count 71
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 77 transition count 71
Applied a total of 15 rules in 15 ms. Remains 77 /83 variables (removed 6) and now considering 71/75 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 77/83 places, 71/75 transitions.
Incomplete random walk after 10000 steps, including 916 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 660 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 662 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 669 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 658 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 665 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Finished probabilistic random walk after 91091 steps, run visited all 5 properties in 655 ms. (steps per millisecond=139 )
Probabilistic random walk after 91091 steps, saw 45589 distinct states, run finished after 655 ms. (steps per millisecond=139 ) properties seen :5
FORMULA DoubleExponent-PT-003-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 262 edges and 158 vertex of which 155 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||G(X(p1))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 3 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2022-05-15 18:28:17] [INFO ] Computed 15 place invariants in 4 ms
[2022-05-15 18:28:17] [INFO ] Implicit Places using invariants in 90 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), 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=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s97 s28), p1:(LEQ s83 s74)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 124 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-003-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-02 finished in 957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U !F(p1)))'
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 155 transition count 113
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 123 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 121 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 69 place count 121 transition count 107
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 77 place count 117 transition count 107
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 131 place count 90 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 88 transition count 80
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 88 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 87 transition count 79
Applied a total of 137 rules in 22 ms. Remains 87 /158 variables (removed 71) and now considering 79/147 (removed 68) transitions.
// Phase 1: matrix 79 rows 87 cols
[2022-05-15 18:28:18] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-15 18:28:18] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 79 rows 87 cols
[2022-05-15 18:28:18] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-15 18:28:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:28:18] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2022-05-15 18:28:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 87 cols
[2022-05-15 18:28:18] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-15 18:28:18] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/158 places, 79/147 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/158 places, 79/147 transitions.
Stuttering acceptance computed with spot in 139 ms :[p1, true, p1, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s49 s46), p0:(AND (LEQ s49 s46) (LEQ s70 s17) (GT 1 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 208 steps with 68 reset in 5 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-03 finished in 407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((F((X(p1) U G(p2)))&&p1))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 155 transition count 114
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 124 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 122 transition count 112
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 67 place count 122 transition count 107
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 117 transition count 107
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 131 place count 90 transition count 80
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 137 place count 87 transition count 80
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 87 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 86 transition count 79
Applied a total of 140 rules in 18 ms. Remains 86 /158 variables (removed 72) and now considering 79/147 (removed 68) transitions.
// Phase 1: matrix 79 rows 86 cols
[2022-05-15 18:28:19] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-15 18:28:19] [INFO ] Implicit Places using invariants in 52 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/158 places, 79/147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 78
Applied a total of 2 rules in 7 ms. Remains 84 /85 variables (removed 1) and now considering 78/79 (removed 1) transitions.
// Phase 1: matrix 78 rows 84 cols
[2022-05-15 18:28:19] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:28:19] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 78 rows 84 cols
[2022-05-15 18:28:19] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:28:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:28:19] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/158 places, 78/147 transitions.
Finished structural reductions, in 2 iterations. Remains : 84/158 places, 78/147 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s20 s72), p0:(OR (LEQ 3 s76) (LEQ 1 s14)), p2:(LEQ s45 s70)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 11904 reset in 198 ms.
Product exploration explored 100000 steps with 11978 reset in 161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 234 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 611 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 1183 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 761 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 84 cols
[2022-05-15 18:28:20] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-15 18:28:20] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:28:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:28:20] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-15 18:28:20] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 18:28:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:28:20] [INFO ] After 6ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 18:28:20] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-15 18:28:20] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 78/78 transitions.
Graph (complete) has 222 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 83 transition count 75
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 81 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 80 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 80 transition count 73
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 10 place count 79 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 77 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 76 transition count 71
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 76 transition count 63
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 32 place count 68 transition count 63
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 44 place count 68 transition count 63
Applied a total of 44 rules in 16 ms. Remains 68 /84 variables (removed 16) and now considering 63/78 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 68/84 places, 63/78 transitions.
Incomplete random walk after 10000 steps, including 1301 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1709 steps, run visited all 1 properties in 14 ms. (steps per millisecond=122 )
Probabilistic random walk after 1709 steps, saw 886 distinct states, run finished after 14 ms. (steps per millisecond=122 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND p1 (NOT p0))), (X p2), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 628 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Support contains 4 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 84 cols
[2022-05-15 18:28:21] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:28:21] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 78 rows 84 cols
[2022-05-15 18:28:21] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:28:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:28:21] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 84 cols
[2022-05-15 18:28:21] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:28:21] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 78/78 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 234 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 1209 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 757 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 84 cols
[2022-05-15 18:28:22] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:28:22] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 18:28:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 18:28:22] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-15 18:28:22] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 18:28:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:28:22] [INFO ] After 6ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 18:28:22] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-15 18:28:22] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 78/78 transitions.
Graph (complete) has 222 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 83 transition count 75
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 81 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 80 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 80 transition count 73
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 10 place count 79 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 77 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 76 transition count 71
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 76 transition count 63
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 32 place count 68 transition count 63
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 44 place count 68 transition count 63
Applied a total of 44 rules in 15 ms. Remains 68 /84 variables (removed 16) and now considering 63/78 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 68/84 places, 63/78 transitions.
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1709 steps, run visited all 1 properties in 11 ms. (steps per millisecond=155 )
Probabilistic random walk after 1709 steps, saw 886 distinct states, run finished after 11 ms. (steps per millisecond=155 ) properties seen :1
Knowledge obtained : [(AND p2 p1), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 11980 reset in 111 ms.
Product exploration explored 100000 steps with 11856 reset in 101 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 78/78 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 84 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 84 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 83 transition count 78
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 83 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 6 rules in 13 ms. Remains 83 /84 variables (removed 1) and now considering 78/78 (removed 0) transitions.
[2022-05-15 18:28:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 78 rows 83 cols
[2022-05-15 18:28:23] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:28:23] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/84 places, 78/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/84 places, 78/78 transitions.
Product exploration explored 100000 steps with 12105 reset in 191 ms.
Product exploration explored 100000 steps with 11884 reset in 184 ms.
Built C files in :
/tmp/ltsmin5930497539105165497
[2022-05-15 18:28:24] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5930497539105165497
Running compilation step : cd /tmp/ltsmin5930497539105165497;'/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 248 ms.
Running link step : cd /tmp/ltsmin5930497539105165497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5930497539105165497;'/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/stateBased9700040554434128570.hoa' '--buchi-type=spotba'
LTSmin run took 3908 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLCardinality-05 finished in 9382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 155 transition count 112
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 122 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 120 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 71 place count 120 transition count 104
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 83 place count 114 transition count 104
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 141 place count 85 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 149 place count 81 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 80 transition count 74
Applied a total of 150 rules in 19 ms. Remains 80 /158 variables (removed 78) and now considering 74/147 (removed 73) transitions.
// Phase 1: matrix 74 rows 80 cols
[2022-05-15 18:28:28] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-15 18:28:28] [INFO ] Implicit Places using invariants in 67 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/158 places, 74/147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 73
Applied a total of 2 rules in 4 ms. Remains 78 /79 variables (removed 1) and now considering 73/74 (removed 1) transitions.
// Phase 1: matrix 73 rows 78 cols
[2022-05-15 18:28:28] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:28:28] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 73 rows 78 cols
[2022-05-15 18:28:28] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:28:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 18:28:28] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/158 places, 73/147 transitions.
Finished structural reductions, in 2 iterations. Remains : 78/158 places, 73/147 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 s19), p1:(GT s70 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-06 finished in 342 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 6 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2022-05-15 18:28:28] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-15 18:28:28] [INFO ] Implicit Places using invariants in 77 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-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:(LEQ s128 s142)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleExponent-PT-003-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-07 finished in 466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 4 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2022-05-15 18:28:29] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-15 18:28:29] [INFO ] Implicit Places using invariants in 56 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s115 s81)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-08 finished in 161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((p0 U F(p1)) U G(p0)))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 147
Applied a total of 1 rules in 4 ms. Remains 157 /158 variables (removed 1) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 157 cols
[2022-05-15 18:28:29] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-15 18:28:29] [INFO ] Implicit Places using invariants in 56 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/158 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 156/158 places, 147/147 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s79 s150), p1:(LEQ 1 s134)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 9179 steps with 311 reset in 16 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-11 finished in 182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(G(p0))))))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 155 transition count 109
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 119 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 73 place count 119 transition count 103
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 113 transition count 103
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 139 place count 86 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 147 place count 82 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 81 transition count 75
Applied a total of 148 rules in 18 ms. Remains 81 /158 variables (removed 77) and now considering 75/147 (removed 72) transitions.
// Phase 1: matrix 75 rows 81 cols
[2022-05-15 18:28:29] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-15 18:28:29] [INFO ] Implicit Places using invariants in 53 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/158 places, 75/147 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 73
Applied a total of 4 rules in 3 ms. Remains 78 /80 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 78 cols
[2022-05-15 18:28:29] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:28:29] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 73 rows 78 cols
[2022-05-15 18:28:29] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-15 18:28:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:28:29] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/158 places, 73/147 transitions.
Finished structural reductions, in 2 iterations. Remains : 78/158 places, 73/147 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s18 s60)], 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 7 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-12 finished in 294 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 147/147 transitions.
Graph (complete) has 262 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 155 transition count 110
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 120 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 119 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 73 place count 119 transition count 103
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 85 place count 113 transition count 103
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 143 place count 84 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 149 place count 81 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 81 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 80 transition count 73
Applied a total of 151 rules in 21 ms. Remains 80 /158 variables (removed 78) and now considering 73/147 (removed 74) transitions.
// Phase 1: matrix 73 rows 80 cols
[2022-05-15 18:28:29] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-15 18:28:29] [INFO ] Implicit Places using invariants in 51 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/158 places, 73/147 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 77 transition count 71
Applied a total of 4 rules in 6 ms. Remains 77 /79 variables (removed 2) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 77 cols
[2022-05-15 18:28:29] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-15 18:28:30] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 71 rows 77 cols
[2022-05-15 18:28:30] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-15 18:28:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 18:28:30] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/158 places, 71/147 transitions.
Finished structural reductions, in 2 iterations. Remains : 77/158 places, 71/147 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s62)], 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 19901 steps with 2779 reset in 21 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-13 finished in 305 ms.
All properties solved by simple procedures.
Total runtime 21482 ms.

BK_STOP 1652639310258

--------------------
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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, 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 r078-tall-165260110000179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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