Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 9.3K Feb 26 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 05:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 127K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679449734999

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 01:48:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 01:48:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:48:56] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-22 01:48:56] [INFO ] Transformed 273 places.
[2023-03-22 01:48:56] [INFO ] Transformed 179 transitions.
[2023-03-22 01:48:56] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 79 places
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 184 transition count 178
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 105 place count 169 transition count 163
Iterating global reduction 1 with 15 rules applied. Total rules applied 120 place count 169 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 121 place count 169 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 168 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 168 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 167 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 167 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 166 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 166 transition count 159
Applied a total of 127 rules in 54 ms. Remains 166 /273 variables (removed 107) and now considering 159/179 (removed 20) transitions.
// Phase 1: matrix 159 rows 166 cols
[2023-03-22 01:48:57] [INFO ] Computed 18 place invariants in 18 ms
[2023-03-22 01:48:57] [INFO ] Implicit Places using invariants in 192 ms returned [136, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 224 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/273 places, 159/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 158
Applied a total of 2 rules in 7 ms. Remains 163 /164 variables (removed 1) and now considering 158/159 (removed 1) transitions.
// Phase 1: matrix 158 rows 163 cols
[2023-03-22 01:48:57] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-22 01:48:57] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-22 01:48:57] [INFO ] Invariant cache hit.
[2023-03-22 01:48:57] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/273 places, 158/179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 501 ms. Remains : 163/273 places, 158/179 transitions.
Support contains 41 out of 163 places after structural reductions.
[2023-03-22 01:48:57] [INFO ] Flatten gal took : 32 ms
[2023-03-22 01:48:57] [INFO ] Flatten gal took : 13 ms
[2023-03-22 01:48:57] [INFO ] Input system was already deterministic with 158 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 27) seen :17
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 01:48:58] [INFO ] Invariant cache hit.
[2023-03-22 01:48:58] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2023-03-22 01:48:58] [INFO ] After 85ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-22 01:48:58] [INFO ] After 180ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-22 01:48:59] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 459 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=229 )
Parikh walk visited 6 properties in 36 ms.
Computed a total of 69 stabilizing places and 69 stable transitions
Graph (complete) has 202 edges and 163 vertex of which 109 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1)||F(p2))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 153 transition count 158
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 17 place count 146 transition count 151
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 146 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 145 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 145 transition count 150
Applied a total of 26 rules in 11 ms. Remains 145 /163 variables (removed 18) and now considering 150/158 (removed 8) transitions.
// Phase 1: matrix 150 rows 145 cols
[2023-03-22 01:48:59] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 01:48:59] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-22 01:48:59] [INFO ] Invariant cache hit.
[2023-03-22 01:48:59] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-22 01:48:59] [INFO ] Invariant cache hit.
[2023-03-22 01:48:59] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/163 places, 150/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 145/163 places, 150/158 transitions.
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s76 1) (LT s77 1)), p2:(OR (LT s8 1) (LT s9 1)), p0:(GEQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 481 reset in 322 ms.
Product exploration explored 100000 steps with 475 reset in 205 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 172 edges and 145 vertex of which 98 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.3 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 376 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 43 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 01:49:01] [INFO ] Invariant cache hit.
[2023-03-22 01:49:01] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:01] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-22 01:49:01] [INFO ] After 68ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 01:49:01] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 01:49:01] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:01] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 01:49:01] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-22 01:49:01] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 963 steps, including 1 resets, run visited all 4 properties in 11 ms. (steps per millisecond=87 )
Parikh walk visited 4 properties in 11 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2))]
False Knowledge obtained : [(F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 7 factoid took 590 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2023-03-22 01:49:02] [INFO ] Invariant cache hit.
[2023-03-22 01:49:02] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 01:49:02] [INFO ] Invariant cache hit.
[2023-03-22 01:49:03] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-22 01:49:03] [INFO ] Invariant cache hit.
[2023-03-22 01:49:03] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 145/145 places, 150/150 transitions.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 172 edges and 145 vertex of which 98 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.7 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 357 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Incomplete random walk after 10001 steps, including 44 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 01:49:03] [INFO ] Invariant cache hit.
[2023-03-22 01:49:03] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-22 01:49:04] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-22 01:49:04] [INFO ] After 73ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 01:49:04] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 01:49:04] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:04] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 01:49:04] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 01:49:04] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 476 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=238 )
Parikh walk visited 4 properties in 14 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 7 factoid took 531 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 482 reset in 134 ms.
Product exploration explored 100000 steps with 482 reset in 225 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Graph (trivial) has 126 edges and 145 vertex of which 18 / 145 are part of one of the 1 SCC in 3 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 153 edges and 128 vertex of which 97 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 97 transition count 104
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 40 place count 97 transition count 105
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 55 place count 97 transition count 105
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 78 place count 74 transition count 82
Deduced a syphon composed of 30 places in 4 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 101 place count 74 transition count 82
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 115 place count 74 transition count 84
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 58 transition count 68
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 58 transition count 68
Performed 9 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 156 place count 58 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 161 place count 58 transition count 95
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 174 place count 45 transition count 67
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 187 place count 45 transition count 67
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 187 rules in 51 ms. Remains 45 /145 variables (removed 100) and now considering 67/150 (removed 83) transitions.
[2023-03-22 01:49:06] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 67 rows 45 cols
[2023-03-22 01:49:06] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 01:49:06] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/145 places, 67/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 45/145 places, 67/150 transitions.
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 150/150 (removed 0) transitions.
// Phase 1: matrix 150 rows 145 cols
[2023-03-22 01:49:06] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 01:49:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 01:49:06] [INFO ] Invariant cache hit.
[2023-03-22 01:49:06] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-22 01:49:06] [INFO ] Invariant cache hit.
[2023-03-22 01:49:06] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 145/145 places, 150/150 transitions.
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-00 finished in 7198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F((p1||(p2&&F(p1))))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 151 transition count 158
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 144 transition count 151
Iterating global reduction 1 with 7 rules applied. Total rules applied 26 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 143 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 142 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 141 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 141 transition count 148
Applied a total of 32 rules in 14 ms. Remains 141 /163 variables (removed 22) and now considering 148/158 (removed 10) transitions.
// Phase 1: matrix 148 rows 141 cols
[2023-03-22 01:49:06] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-22 01:49:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-22 01:49:06] [INFO ] Invariant cache hit.
[2023-03-22 01:49:06] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-22 01:49:06] [INFO ] Invariant cache hit.
[2023-03-22 01:49:06] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/163 places, 148/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 141/163 places, 148/158 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s129 1), p1:(LT s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-01 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 151 transition count 158
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 145 transition count 152
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 145 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 144 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 143 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 142 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 142 transition count 149
Applied a total of 30 rules in 14 ms. Remains 142 /163 variables (removed 21) and now considering 149/158 (removed 9) transitions.
// Phase 1: matrix 149 rows 142 cols
[2023-03-22 01:49:07] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 01:49:07] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 01:49:07] [INFO ] Invariant cache hit.
[2023-03-22 01:49:07] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-22 01:49:07] [INFO ] Invariant cache hit.
[2023-03-22 01:49:07] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/163 places, 149/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 142/163 places, 149/158 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s132 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-02 finished in 324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||G((X(p2)||p1)))))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 152 transition count 158
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 146 transition count 152
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 146 transition count 152
Applied a total of 23 rules in 14 ms. Remains 146 /163 variables (removed 17) and now considering 152/158 (removed 6) transitions.
// Phase 1: matrix 152 rows 146 cols
[2023-03-22 01:49:07] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-22 01:49:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-22 01:49:07] [INFO ] Invariant cache hit.
[2023-03-22 01:49:07] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-22 01:49:07] [INFO ] Invariant cache hit.
[2023-03-22 01:49:07] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/163 places, 152/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 146/163 places, 152/158 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 3}]], initial=6, aps=[p2:(GEQ s45 1), p1:(OR (GEQ s63 1) (GEQ s108 1)), p0:(AND (GEQ s84 1) (GEQ s85 1) (GEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-03 finished in 547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Graph (complete) has 202 edges and 163 vertex of which 148 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Ensure Unique test removed 12 places
Reduce places removed 13 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 135 transition count 63
Reduce places removed 79 places and 0 transitions.
Graph (trivial) has 43 edges and 56 vertex of which 6 / 56 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 51 transition count 63
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 167 place count 51 transition count 56
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 167 place count 51 transition count 39
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 203 place count 32 transition count 39
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 206 place count 31 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 208 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 209 place count 28 transition count 36
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 28 transition count 36
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 230 place count 18 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 232 place count 18 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 238 place count 15 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 239 place count 15 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 241 place count 15 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 14 transition count 20
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 243 place count 13 transition count 20
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 244 place count 12 transition count 18
Iterating global reduction 8 with 1 rules applied. Total rules applied 245 place count 12 transition count 18
Applied a total of 245 rules in 20 ms. Remains 12 /163 variables (removed 151) and now considering 18/158 (removed 140) transitions.
// Phase 1: matrix 18 rows 12 cols
[2023-03-22 01:49:07] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 01:49:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 01:49:07] [INFO ] Invariant cache hit.
[2023-03-22 01:49:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:07] [INFO ] Implicit Places using invariants and state equation in 29 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/163 places, 16/158 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 11/163 places, 16/158 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-05 finished in 147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F((p0&&F(!p1))) U X(X(p1))) U p1))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 153 transition count 158
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 147 transition count 152
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 147 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 146 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 146 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 145 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 145 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 144 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 144 transition count 149
Applied a total of 28 rules in 16 ms. Remains 144 /163 variables (removed 19) and now considering 149/158 (removed 9) transitions.
// Phase 1: matrix 149 rows 144 cols
[2023-03-22 01:49:08] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 01:49:08] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 01:49:08] [INFO ] Invariant cache hit.
[2023-03-22 01:49:08] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-22 01:49:08] [INFO ] Invariant cache hit.
[2023-03-22 01:49:08] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/163 places, 149/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 144/163 places, 149/158 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s43 1) (GEQ s44 1) (GEQ s45 1)), p0:(GEQ s39 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2206 steps with 22 reset in 13 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-06 finished in 585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Graph (complete) has 202 edges and 163 vertex of which 123 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Ensure Unique test removed 9 places
Reduce places removed 10 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 113 transition count 55
Reduce places removed 67 places and 0 transitions.
Graph (trivial) has 37 edges and 46 vertex of which 6 / 46 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 41 transition count 55
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 143 place count 41 transition count 48
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 143 place count 41 transition count 35
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 170 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 26 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 26 transition count 34
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 188 place count 18 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 190 place count 18 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 196 place count 15 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 15 transition count 23
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 200 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 14 transition count 19
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 202 place count 13 transition count 19
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 203 place count 12 transition count 17
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 12 transition count 17
Applied a total of 204 rules in 14 ms. Remains 12 /163 variables (removed 151) and now considering 17/158 (removed 141) transitions.
// Phase 1: matrix 17 rows 12 cols
[2023-03-22 01:49:08] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 01:49:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 01:49:08] [INFO ] Invariant cache hit.
[2023-03-22 01:49:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:08] [INFO ] Implicit Places using invariants and state equation in 25 ms returned [3]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/163 places, 16/158 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 14
Applied a total of 2 rules in 4 ms. Remains 10 /11 variables (removed 1) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 10 cols
[2023-03-22 01:49:08] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 01:49:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 01:49:08] [INFO ] Invariant cache hit.
[2023-03-22 01:49:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/163 places, 14/158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 10/163 places, 14/158 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s2 1), p0:(OR (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 412 steps with 26 reset in 4 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-07 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Graph (complete) has 202 edges and 163 vertex of which 109 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 100 transition count 51
Reduce places removed 60 places and 0 transitions.
Graph (trivial) has 33 edges and 40 vertex of which 6 / 40 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 35 transition count 51
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 129 place count 35 transition count 44
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 129 place count 35 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 151 place count 24 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 23 transition count 32
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 23 transition count 32
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 167 place count 16 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 16 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 175 place count 13 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 13 transition count 22
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 179 place count 13 transition count 19
Applied a total of 179 rules in 13 ms. Remains 13 /163 variables (removed 150) and now considering 19/158 (removed 139) transitions.
// Phase 1: matrix 19 rows 13 cols
[2023-03-22 01:49:08] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 01:49:08] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/163 places, 19/158 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 17
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 17
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 11 cols
[2023-03-22 01:49:08] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-22 01:49:08] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-22 01:49:08] [INFO ] Invariant cache hit.
[2023-03-22 01:49:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:08] [INFO ] Implicit Places using invariants and state equation in 25 ms returned [2]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/163 places, 16/158 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 9 transition count 14
Applied a total of 3 rules in 3 ms. Remains 9 /10 variables (removed 1) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-22 01:49:08] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 01:49:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 01:49:08] [INFO ] Invariant cache hit.
[2023-03-22 01:49:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 9/163 places, 14/158 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 125 ms. Remains : 9/163 places, 14/158 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-08 finished in 388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Graph (complete) has 202 edges and 163 vertex of which 109 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 100 transition count 53
Reduce places removed 58 places and 0 transitions.
Graph (trivial) has 36 edges and 42 vertex of which 6 / 42 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 37 transition count 52
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 127 place count 36 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 127 place count 36 transition count 34
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 149 place count 25 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 24 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 24 transition count 33
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 167 place count 16 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 16 transition count 23
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 4 with 6 rules applied. Total rules applied 174 place count 13 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 176 place count 13 transition count 21
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 180 place count 13 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 182 place count 11 transition count 15
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 183 place count 10 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 9 transition count 14
Applied a total of 184 rules in 13 ms. Remains 9 /163 variables (removed 154) and now considering 14/158 (removed 144) transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-22 01:49:09] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 01:49:09] [INFO ] Invariant cache hit.
[2023-03-22 01:49:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants and state equation in 25 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/163 places, 13/158 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 8/163 places, 13/158 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 35 steps with 5 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-09 finished in 110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Graph (complete) has 202 edges and 163 vertex of which 109 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 100 transition count 52
Reduce places removed 59 places and 0 transitions.
Graph (trivial) has 34 edges and 41 vertex of which 6 / 41 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 121 place count 36 transition count 51
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 129 place count 35 transition count 44
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 129 place count 35 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 151 place count 24 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 23 transition count 32
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 23 transition count 32
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 169 place count 15 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 171 place count 15 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 177 place count 12 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 179 place count 12 transition count 20
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 183 place count 12 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 10 transition count 14
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 186 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 8 transition count 13
Applied a total of 187 rules in 17 ms. Remains 8 /163 variables (removed 155) and now considering 13/158 (removed 145) transitions.
// Phase 1: matrix 13 rows 8 cols
[2023-03-22 01:49:09] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 01:49:09] [INFO ] Invariant cache hit.
[2023-03-22 01:49:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants and state equation in 23 ms returned [3]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/163 places, 11/158 transitions.
Applied a total of 0 rules in 4 ms. Remains 7 /7 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 7/163 places, 11/158 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 240 steps with 31 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-10 finished in 183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Graph (complete) has 202 edges and 163 vertex of which 109 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 102 transition count 53
Reduce places removed 58 places and 0 transitions.
Graph (trivial) has 34 edges and 44 vertex of which 6 / 44 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 39 transition count 53
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 125 place count 39 transition count 46
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 125 place count 39 transition count 34
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 149 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 26 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 26 transition count 33
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 169 place count 17 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 17 transition count 22
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 4 with 2 rules applied. Total rules applied 172 place count 16 transition count 23
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 176 place count 16 transition count 19
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 15 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 179 place count 14 transition count 18
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 13 transition count 18
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 181 place count 12 transition count 17
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 12 transition count 17
Applied a total of 182 rules in 14 ms. Remains 12 /163 variables (removed 151) and now considering 17/158 (removed 141) transitions.
// Phase 1: matrix 17 rows 12 cols
[2023-03-22 01:49:09] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 01:49:09] [INFO ] Invariant cache hit.
[2023-03-22 01:49:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/163 places, 15/158 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62 ms. Remains : 11/163 places, 15/158 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s9 1) (NOT (AND (GEQ s2 1) (GEQ s3 1)))), p0:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-11 finished in 167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Graph (complete) has 202 edges and 163 vertex of which 115 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 96 edges and 106 vertex of which 18 / 106 are part of one of the 1 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 89 transition count 68
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 118 place count 41 transition count 49
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 118 place count 41 transition count 34
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 148 place count 26 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 25 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 25 transition count 33
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 166 place count 17 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 168 place count 17 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 172 place count 15 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 174 place count 15 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 14 transition count 19
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 177 place count 13 transition count 19
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 12 transition count 18
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 12 transition count 18
Applied a total of 179 rules in 13 ms. Remains 12 /163 variables (removed 151) and now considering 18/158 (removed 140) transitions.
// Phase 1: matrix 18 rows 12 cols
[2023-03-22 01:49:09] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 01:49:09] [INFO ] Invariant cache hit.
[2023-03-22 01:49:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants and state equation in 23 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/163 places, 17/158 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 16
Applied a total of 1 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 11 cols
[2023-03-22 01:49:09] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 01:49:09] [INFO ] Invariant cache hit.
[2023-03-22 01:49:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/163 places, 16/158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 11/163 places, 16/158 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s3 1), p1:(LT s2 1)], nbAcceptance=2, 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 5841 steps with 339 reset in 16 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-12 finished in 193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Graph (complete) has 202 edges and 163 vertex of which 116 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.0 ms
Discarding 47 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 107 transition count 56
Reduce places removed 62 places and 0 transitions.
Graph (trivial) has 37 edges and 45 vertex of which 6 / 45 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 40 transition count 56
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 133 place count 40 transition count 49
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 133 place count 40 transition count 35
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 161 place count 26 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 25 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 25 transition count 34
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 179 place count 17 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 17 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 187 place count 14 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 189 place count 14 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 14 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 13 transition count 20
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 192 place count 12 transition count 20
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 193 place count 11 transition count 18
Iterating global reduction 6 with 1 rules applied. Total rules applied 194 place count 11 transition count 18
Applied a total of 194 rules in 12 ms. Remains 11 /163 variables (removed 152) and now considering 18/158 (removed 140) transitions.
// Phase 1: matrix 18 rows 11 cols
[2023-03-22 01:49:09] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 01:49:09] [INFO ] Invariant cache hit.
[2023-03-22 01:49:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:09] [INFO ] Implicit Places using invariants and state equation in 25 ms returned [3]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/163 places, 17/158 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 16
Applied a total of 1 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 01:49:09] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 01:49:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 01:49:10] [INFO ] Invariant cache hit.
[2023-03-22 01:49:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:10] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/163 places, 16/158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 10/163 places, 16/158 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-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:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-13 finished in 162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&X(X(G(p0))))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 154 transition count 158
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 147 transition count 151
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 147 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 146 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 146 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 145 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 145 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 144 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 144 transition count 148
Applied a total of 29 rules in 9 ms. Remains 144 /163 variables (removed 19) and now considering 148/158 (removed 10) transitions.
// Phase 1: matrix 148 rows 144 cols
[2023-03-22 01:49:10] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-22 01:49:10] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-22 01:49:10] [INFO ] Invariant cache hit.
[2023-03-22 01:49:10] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-22 01:49:10] [INFO ] Invariant cache hit.
[2023-03-22 01:49:10] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/163 places, 148/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 144/163 places, 148/158 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s30 1) (LT s31 1) (LT s32 1)), p1:(OR (GEQ s92 1) (AND (GEQ s126 1) (GEQ s127 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 64 steps with 1 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-14 finished in 449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 152 transition count 158
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 146 transition count 152
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 145 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 144 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 143 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 143 transition count 149
Applied a total of 29 rules in 11 ms. Remains 143 /163 variables (removed 20) and now considering 149/158 (removed 9) transitions.
// Phase 1: matrix 149 rows 143 cols
[2023-03-22 01:49:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 01:49:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 01:49:10] [INFO ] Invariant cache hit.
[2023-03-22 01:49:10] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-22 01:49:10] [INFO ] Invariant cache hit.
[2023-03-22 01:49:10] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/163 places, 149/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 143/163 places, 149/158 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-15 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}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s136 1), p1:(AND (LT s97 1) (OR (LT s115 1) (LT s117 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Computed a total of 62 stabilizing places and 66 stable transitions
Graph (complete) has 167 edges and 143 vertex of which 98 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.2 ms
Computed a total of 62 stabilizing places and 66 stable transitions
Detected a total of 62/143 stabilizing places and 66/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBMB2S565S3960-PT-none-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-15 finished in 781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1)||F(p2))))'
Found a Lengthening insensitive property : IBMB2S565S3960-PT-none-LTLFireability-00
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 163/163 places, 158/158 transitions.
Graph (complete) has 202 edges and 163 vertex of which 126 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 117 transition count 61
Reduce places removed 65 places and 0 transitions.
Graph (trivial) has 39 edges and 52 vertex of which 6 / 52 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 47 transition count 61
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 139 place count 47 transition count 54
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 139 place count 47 transition count 40
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 167 place count 33 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 32 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 32 transition count 39
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 185 place count 24 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 187 place count 24 transition count 28
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 193 place count 21 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 194 place count 21 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 20 transition count 27
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 196 place count 19 transition count 27
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 197 place count 18 transition count 25
Iterating global reduction 6 with 1 rules applied. Total rules applied 198 place count 18 transition count 25
Applied a total of 198 rules in 12 ms. Remains 18 /163 variables (removed 145) and now considering 25/158 (removed 133) transitions.
// Phase 1: matrix 25 rows 18 cols
[2023-03-22 01:49:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 01:49:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 01:49:11] [INFO ] Invariant cache hit.
[2023-03-22 01:49:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:11] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [10]
Discarding 1 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 55 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/163 places, 23/158 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 68 ms. Remains : 17/163 places, 23/158 transitions.
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s8 1) (LT s9 1)), p2:(OR (LT s1 1) (LT s2 1)), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6707 reset in 89 ms.
Product exploration explored 100000 steps with 6691 reset in 100 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 26 edges and 17 vertex of which 10 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 615 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 118 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 23 rows 17 cols
[2023-03-22 01:49:12] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 01:49:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-22 01:49:12] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 01:49:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:12] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 01:49:12] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 01:49:12] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2))]
False Knowledge obtained : [(F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 7 factoid took 605 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-22 01:49:13] [INFO ] Invariant cache hit.
[2023-03-22 01:49:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-22 01:49:13] [INFO ] Invariant cache hit.
[2023-03-22 01:49:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:13] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-22 01:49:13] [INFO ] Invariant cache hit.
[2023-03-22 01:49:13] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 17/17 places, 23/23 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 26 edges and 17 vertex of which 10 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 488 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Incomplete random walk after 10001 steps, including 630 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:49:14] [INFO ] Invariant cache hit.
[2023-03-22 01:49:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 01:49:14] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 01:49:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:14] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 01:49:14] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 01:49:14] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 7 factoid took 684 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 6679 reset in 89 ms.
Product exploration explored 100000 steps with 6710 reset in 88 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 23/23 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 22
Applied a total of 1 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 22/23 (removed 1) transitions.
[2023-03-22 01:49:16] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 22 rows 17 cols
[2023-03-22 01:49:16] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 01:49:16] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/17 places, 22/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 17/17 places, 22/23 transitions.
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 17 cols
[2023-03-22 01:49:16] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 01:49:16] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 01:49:16] [INFO ] Invariant cache hit.
[2023-03-22 01:49:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:49:16] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-22 01:49:16] [INFO ] Invariant cache hit.
[2023-03-22 01:49:16] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 17/17 places, 23/23 transitions.
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-00 finished in 5195 ms.
[2023-03-22 01:49:16] [INFO ] Flatten gal took : 14 ms
[2023-03-22 01:49:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 01:49:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 158 transitions and 358 arcs took 2 ms.
Total runtime 19982 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1591/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : IBMB2S565S3960-PT-none-LTLFireability-00

BK_STOP 1679449757725

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name IBMB2S565S3960-PT-none-LTLFireability-00
ltl formula formula --ltl=/tmp/1591/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 163 places, 158 transitions and 358 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1591/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1591/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1591/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1591/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is IBMB2S565S3960-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856418400100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;