Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 11K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 127K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1652745695823

Running Version 202205111006
[2022-05-17 00:01:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 00:01:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:01:37] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2022-05-17 00:01:37] [INFO ] Transformed 273 places.
[2022-05-17 00:01:37] [INFO ] Transformed 179 transitions.
[2022-05-17 00:01:37] [INFO ] Parsed PT model containing 273 places and 179 transitions in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-10 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 80 places
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 183 transition count 178
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 108 place count 166 transition count 161
Iterating global reduction 1 with 17 rules applied. Total rules applied 125 place count 166 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 164 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 164 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 163 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 163 transition count 157
Applied a total of 132 rules in 56 ms. Remains 163 /273 variables (removed 110) and now considering 157/179 (removed 22) transitions.
// Phase 1: matrix 157 rows 163 cols
[2022-05-17 00:01:37] [INFO ] Computed 17 place invariants in 16 ms
[2022-05-17 00:01:37] [INFO ] Implicit Places using invariants in 173 ms returned [135, 151]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 198 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/273 places, 157/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 160 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 160 transition count 156
Applied a total of 2 rules in 8 ms. Remains 160 /161 variables (removed 1) and now considering 156/157 (removed 1) transitions.
// Phase 1: matrix 156 rows 160 cols
[2022-05-17 00:01:37] [INFO ] Computed 15 place invariants in 6 ms
[2022-05-17 00:01:37] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 156 rows 160 cols
[2022-05-17 00:01:37] [INFO ] Computed 15 place invariants in 12 ms
[2022-05-17 00:01:37] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/273 places, 156/179 transitions.
Finished structural reductions, in 2 iterations. Remains : 160/273 places, 156/179 transitions.
Support contains 41 out of 160 places after structural reductions.
[2022-05-17 00:01:37] [INFO ] Flatten gal took : 36 ms
[2022-05-17 00:01:37] [INFO ] Flatten gal took : 16 ms
[2022-05-17 00:01:37] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 33 out of 160 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10003 steps, including 42 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 23) seen :15
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 156 rows 160 cols
[2022-05-17 00:01:38] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 00:01:38] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-17 00:01:38] [INFO ] After 102ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2022-05-17 00:01:38] [INFO ] After 203ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-05-17 00:01:38] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :6
Finished Parikh walk after 250 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=125 )
Parikh walk visited 6 properties in 27 ms.
Computed a total of 66 stabilizing places and 69 stable transitions
Graph (complete) has 198 edges and 160 vertex of which 105 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.13 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(G((p0 U p1)) U !F(p2)))))'
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 145 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 144 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 143 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 143 transition count 149
Applied a total of 24 rules in 13 ms. Remains 143 /160 variables (removed 17) and now considering 149/156 (removed 7) transitions.
// Phase 1: matrix 149 rows 143 cols
[2022-05-17 00:01:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 00:01:39] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 149 rows 143 cols
[2022-05-17 00:01:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:01:39] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 149 rows 143 cols
[2022-05-17 00:01:39] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-17 00:01:39] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/160 places, 149/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/160 places, 149/156 transitions.
Stuttering acceptance computed with spot in 370 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (GEQ s91 1) (AND (GEQ s12 1) (GEQ s13 1))), p0:(GEQ s89 1), p1:(GEQ s128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3057 reset in 287 ms.
Product exploration explored 100000 steps with 3031 reset in 162 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.3 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/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT p2)), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 306 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT p2)), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 7 factoid took 272 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p2)]
// Phase 1: matrix 149 rows 143 cols
[2022-05-17 00:01:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:01:41] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 00:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:01:41] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-17 00:01:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:01:41] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 00:01:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:01:41] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-17 00:01:41] [INFO ] Computed and/alt/rep : 148/174/148 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-17 00:01:41] [INFO ] Added : 98 causal constraints over 20 iterations in 292 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 143 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 149/149 transitions.
Graph (trivial) has 121 edges and 143 vertex of which 18 / 143 are part of one of the 1 SCC in 10 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 148 edges and 126 vertex of which 82 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 81 transition count 45
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 37 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 36 transition count 44
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 92 place count 36 transition count 34
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 112 place count 26 transition count 34
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 124 place count 20 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 20 transition count 25
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 18 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 133 place count 18 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 136 place count 18 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 17 transition count 19
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 16 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 15 transition count 18
Applied a total of 139 rules in 36 ms. Remains 15 /143 variables (removed 128) and now considering 18/149 (removed 131) transitions.
// Phase 1: matrix 18 rows 15 cols
[2022-05-17 00:01:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:01:41] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-05-17 00:01:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:01:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:41] [INFO ] Implicit Places using invariants and state equation in 27 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/143 places, 18/149 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 14/143 places, 18/149 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 19 edges and 14 vertex of which 13 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p2)]
// Phase 1: matrix 18 rows 14 cols
[2022-05-17 00:01:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:01:42] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 00:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:01:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 00:01:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:01:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 00:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:01:42] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:01:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:01:42] [INFO ] Computed and/alt/rep : 13/23/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:01:42] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 23 steps with 2 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-00 finished in 3148 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(F(p0)) U p1))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 149 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 144 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 143 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 142 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 142 transition count 149
Applied a total of 25 rules in 20 ms. Remains 142 /160 variables (removed 18) and now considering 149/156 (removed 7) transitions.
// Phase 1: matrix 149 rows 142 cols
[2022-05-17 00:01:42] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:01:42] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 149 rows 142 cols
[2022-05-17 00:01:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:42] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 149 rows 142 cols
[2022-05-17 00:01:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:42] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/160 places, 149/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/160 places, 149/156 transitions.
Stuttering acceptance computed with spot in 123 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s127 1), p1:(GEQ s140 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]]
Entered a terminal (fully accepting) state of product in 424 steps with 1 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-01 finished in 363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||X(X(G(p1)))))||G(p2)))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Graph (complete) has 198 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 42 output transitions
Drop transitions removed 42 transitions
Ensure Unique test removed 8 places
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 104 transition count 52
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 42 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 41 transition count 51
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 127 place count 41 transition count 39
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 151 place count 29 transition count 39
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 172 place count 18 transition count 29
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 176 place count 18 transition count 25
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 16 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 181 place count 16 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 5 with 4 rules applied. Total rules applied 185 place count 14 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 186 place count 14 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 14 transition count 21
Applied a total of 187 rules in 12 ms. Remains 14 /160 variables (removed 146) and now considering 21/156 (removed 135) transitions.
// Phase 1: matrix 21 rows 14 cols
[2022-05-17 00:01:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:01:42] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 21 rows 14 cols
[2022-05-17 00:01:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:01:42] [INFO ] Implicit Places using invariants and state equation in 28 ms returned [7]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/160 places, 20/156 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 13 transition count 19
Applied a total of 1 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 13 cols
[2022-05-17 00:01:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:01:42] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 19 rows 13 cols
[2022-05-17 00:01:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:01:42] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/160 places, 19/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 13/160 places, 19/156 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(LT s11 1), p0:(AND (GEQ s4 1) (GEQ s5 1)), p1:(GEQ s6 1)], nbAcceptance=2, 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 15 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 202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F((G(X(p0)) U p0)))||p1)))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Graph (trivial) has 117 edges and 160 vertex of which 12 / 160 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 186 edges and 149 vertex of which 96 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 88 transition count 46
Reduce places removed 51 places and 0 transitions.
Graph (trivial) has 27 edges and 37 vertex of which 2 / 37 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 36 transition count 45
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 109 place count 35 transition count 43
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 109 place count 35 transition count 32
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 131 place count 24 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 23 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 23 transition count 31
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 145 place count 17 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 148 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 4 with 4 rules applied. Total rules applied 152 place count 15 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 153 place count 15 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 154 place count 15 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 14 transition count 20
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 13 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 12 transition count 19
Applied a total of 157 rules in 11 ms. Remains 12 /160 variables (removed 148) and now considering 19/156 (removed 137) transitions.
// Phase 1: matrix 19 rows 12 cols
[2022-05-17 00:01:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:01:43] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 19 rows 12 cols
[2022-05-17 00:01:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:01:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:43] [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 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/160 places, 18/156 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 17
Applied a total of 1 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 11 cols
[2022-05-17 00:01:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:01:43] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 17 rows 11 cols
[2022-05-17 00:01:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:01:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/160 places, 17/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/160 places, 17/156 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3 1), p0:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-04 finished in 186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 149 transition count 156
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 143 transition count 150
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 142 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 141 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 141 transition count 148
Applied a total of 27 rules in 16 ms. Remains 141 /160 variables (removed 19) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:43] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:43] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-17 00:01:43] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:43] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:01:43] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/160 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/160 places, 148/156 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-05 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 s102 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 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-05 finished in 290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 145 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 144 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 143 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 143 transition count 149
Applied a total of 24 rules in 8 ms. Remains 143 /160 variables (removed 17) and now considering 149/156 (removed 7) transitions.
// Phase 1: matrix 149 rows 143 cols
[2022-05-17 00:01:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 00:01:43] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 149 rows 143 cols
[2022-05-17 00:01:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-17 00:01:43] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 149 rows 143 cols
[2022-05-17 00:01:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:01:43] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/160 places, 149/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/160 places, 149/156 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s42 1) (LT s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 168 edges and 143 vertex of which 97 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.1 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-06 finished in 718 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)))))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 145 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 145 transition count 151
Applied a total of 20 rules in 8 ms. Remains 145 /160 variables (removed 15) and now considering 151/156 (removed 5) transitions.
// Phase 1: matrix 151 rows 145 cols
[2022-05-17 00:01:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:01:44] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 151 rows 145 cols
[2022-05-17 00:01:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:01:44] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 151 rows 145 cols
[2022-05-17 00:01:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:01:44] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/160 places, 151/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/160 places, 151/156 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s42 1) (GEQ s43 1)), p0:(GEQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-07 finished in 357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(p0)))))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Graph (trivial) has 118 edges and 160 vertex of which 12 / 160 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 186 edges and 149 vertex of which 97 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.1 ms
Discarding 52 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 89 transition count 45
Reduce places removed 54 places and 0 transitions.
Graph (trivial) has 29 edges and 35 vertex of which 2 / 35 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 34 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 34 transition count 43
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 113 place count 34 transition count 32
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 135 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 22 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 22 transition count 31
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
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 151 place count 15 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 154 place count 15 transition count 21
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 4 with 4 rules applied. Total rules applied 158 place count 13 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 160 place count 13 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 13 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 12 transition count 17
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 164 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 10 transition count 16
Applied a total of 165 rules in 7 ms. Remains 10 /160 variables (removed 150) and now considering 16/156 (removed 140) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 00:01:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:44] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 00:01:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:44] [INFO ] Implicit Places using invariants and state equation in 22 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 : 9/160 places, 14/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/160 places, 14/156 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
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 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s3 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 13 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 147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||G(p1)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 149 transition count 156
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 143 transition count 150
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 142 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 141 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 141 transition count 148
Applied a total of 27 rules in 12 ms. Remains 141 /160 variables (removed 19) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:44] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:44] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:45] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/160 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/160 places, 148/156 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s86 1), p1:(AND (GEQ s86 1) (GEQ s93 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/141 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 113 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-09 finished in 1014 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(X(G(!X((G(p0)||p1)))))||!p1)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Graph (trivial) has 117 edges and 160 vertex of which 12 / 160 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 186 edges and 149 vertex of which 94 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 47 output transitions
Drop transitions removed 47 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 86 transition count 46
Reduce places removed 50 places and 0 transitions.
Graph (trivial) has 28 edges and 36 vertex of which 2 / 36 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 35 transition count 45
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 34 transition count 43
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 107 place count 34 transition count 32
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 129 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 22 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 22 transition count 31
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 143 place count 16 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 145 place count 16 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 149 place count 14 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 151 place count 14 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 154 place count 14 transition count 18
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 5 with 2 rules applied. Total rules applied 156 place count 13 transition count 17
Applied a total of 156 rules in 27 ms. Remains 13 /160 variables (removed 147) and now considering 17/156 (removed 139) transitions.
// Phase 1: matrix 17 rows 13 cols
[2022-05-17 00:01:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:01:45] [INFO ] Implicit Places using invariants in 26 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/160 places, 17/156 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 16
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 11 cols
[2022-05-17 00:01:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:45] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 16 rows 11 cols
[2022-05-17 00:01:45] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-17 00:01:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:45] [INFO ] Implicit Places using invariants and state equation in 27 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 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/160 places, 15/156 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 10/160 places, 15/156 transitions.
Stuttering acceptance computed with spot in 104 ms :[p1, (OR p1 p0), p0]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s4 1), p0:(GEQ s3 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 19 steps with 1 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-11 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G((p0 U X(X(X(p0)))))))))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 156
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 144 transition count 150
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 143 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 143 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 142 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 142 transition count 148
Applied a total of 26 rules in 5 ms. Remains 142 /160 variables (removed 18) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 142 cols
[2022-05-17 00:01:45] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-17 00:01:46] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 148 rows 142 cols
[2022-05-17 00:01:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:01:46] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 142 cols
[2022-05-17 00:01:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:01:46] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/160 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/160 places, 148/156 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 6}, { cond=(NOT p0), acceptance={0} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s64 1) (GEQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 218 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-12 finished in 517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 156
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 144 transition count 150
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 143 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 143 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 142 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 142 transition count 148
Applied a total of 26 rules in 13 ms. Remains 142 /160 variables (removed 18) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 142 cols
[2022-05-17 00:01:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:01:46] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 148 rows 142 cols
[2022-05-17 00:01:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:01:46] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 142 cols
[2022-05-17 00:01:46] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-17 00:01:46] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/160 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/160 places, 148/156 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s31 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-13 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(X(p0)) U X(p1)))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 151 transition count 156
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 145 transition count 150
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 145 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 144 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 144 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 143 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 143 transition count 148
Applied a total of 25 rules in 11 ms. Remains 143 /160 variables (removed 17) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 143 cols
[2022-05-17 00:01:46] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:01:46] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 148 rows 143 cols
[2022-05-17 00:01:46] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 00:01:46] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 143 cols
[2022-05-17 00:01:46] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:01:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/160 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/160 places, 148/156 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), true, 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=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s35 1), p0:(AND (GEQ s47 1) (GEQ s48 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 262 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-14 finished in 336 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 156/156 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 149 transition count 156
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 143 transition count 150
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 142 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 141 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 141 transition count 148
Applied a total of 27 rules in 8 ms. Remains 141 /160 variables (removed 19) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:47] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:47] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:01:47] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:47] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-17 00:01:47] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/160 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/160 places, 148/156 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-15 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:(LT s139 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 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-15 finished in 267 ms.
All properties solved by simple procedures.
Total runtime 10429 ms.

BK_STOP 1652745707514

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is 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 r132-tall-165271820400100"
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 ;