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.r231-tall-167856415600099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is IBMB2S565S3960-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415600099
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-01
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-02
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-03
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-04
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-05
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-06
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-07
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-08
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-09
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-10
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-11
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-12
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-13
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-14
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679434460072

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 21:34:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 21:34:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:34:21] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-21 21:34:21] [INFO ] Transformed 273 places.
[2023-03-21 21:34:21] [INFO ] Transformed 179 transitions.
[2023-03-21 21:34:21] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 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 90 places
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 174 transition count 178
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 114 place count 160 transition count 164
Iterating global reduction 1 with 14 rules applied. Total rules applied 128 place count 160 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 158 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 158 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 157 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 157 transition count 161
Applied a total of 134 rules in 113 ms. Remains 157 /273 variables (removed 116) and now considering 161/179 (removed 18) transitions.
// Phase 1: matrix 161 rows 157 cols
[2023-03-21 21:34:22] [INFO ] Computed 7 place invariants in 18 ms
[2023-03-21 21:34:22] [INFO ] Implicit Places using invariants in 188 ms returned [125, 142]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 214 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/273 places, 161/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 160
Applied a total of 2 rules in 8 ms. Remains 154 /155 variables (removed 1) and now considering 160/161 (removed 1) transitions.
// Phase 1: matrix 160 rows 154 cols
[2023-03-21 21:34:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-21 21:34:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-21 21:34:22] [INFO ] Invariant cache hit.
[2023-03-21 21:34:22] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 154/273 places, 160/179 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 517 ms. Remains : 154/273 places, 160/179 transitions.
Support contains 43 out of 154 places after structural reductions.
[2023-03-21 21:34:22] [INFO ] Flatten gal took : 28 ms
[2023-03-21 21:34:22] [INFO ] Flatten gal took : 12 ms
[2023-03-21 21:34:22] [INFO ] Input system was already deterministic with 160 transitions.
Incomplete random walk after 10001 steps, including 37 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 31) seen :21
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-21 21:34:23] [INFO ] Invariant cache hit.
[2023-03-21 21:34:23] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 21:34:23] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-21 21:34:24] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-21 21:34:24] [INFO ] After 421ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-21 21:34:24] [INFO ] After 642ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Finished Parikh walk after 544 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=181 )
Parikh walk visited 8 properties in 48 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 67 stabilizing places and 72 stable transitions
Graph (complete) has 180 edges and 154 vertex of which 103 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.7 ms
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 144 transition count 152
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 144 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 143 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 142 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 141 transition count 148
Applied a total of 25 rules in 22 ms. Remains 141 /154 variables (removed 13) and now considering 148/160 (removed 12) transitions.
// Phase 1: matrix 148 rows 141 cols
[2023-03-21 21:34:24] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-21 21:34:24] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-21 21:34:24] [INFO ] Invariant cache hit.
[2023-03-21 21:34:25] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-21 21:34:25] [INFO ] Invariant cache hit.
[2023-03-21 21:34:25] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/154 places, 148/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 141/154 places, 148/160 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-00 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:(LEQ 1 s100)], 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 2 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-00 finished in 450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p1&&X(X(F(p2))))))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 144 transition count 152
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 144 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 143 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 142 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 141 transition count 148
Applied a total of 25 rules in 17 ms. Remains 141 /154 variables (removed 13) and now considering 148/160 (removed 12) transitions.
[2023-03-21 21:34:25] [INFO ] Invariant cache hit.
[2023-03-21 21:34:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-21 21:34:25] [INFO ] Invariant cache hit.
[2023-03-21 21:34:25] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-21 21:34:25] [INFO ] Invariant cache hit.
[2023-03-21 21:34:25] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/154 places, 148/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 141/154 places, 148/160 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=5, aps=[p2:(GT 1 s88), p0:(GT 3 s34), p1:(GT s26 s97)], 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 478 reset in 251 ms.
Product exploration explored 100000 steps with 465 reset in 172 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.4 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10004 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2709941 steps, run timeout after 3001 ms. (steps per millisecond=903 ) properties seen :{}
Probabilistic random walk after 2709941 steps, saw 504230 distinct states, run finished after 3003 ms. (steps per millisecond=902 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 21:34:29] [INFO ] Invariant cache hit.
[2023-03-21 21:34:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 21:34:29] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:34:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 0 ms returned sat
[2023-03-21 21:34:29] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:34:29] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-21 21:34:29] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 180 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 141 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-21 21:34:30] [INFO ] Invariant cache hit.
[2023-03-21 21:34:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-21 21:34:30] [INFO ] Invariant cache hit.
[2023-03-21 21:34:30] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-21 21:34:30] [INFO ] Invariant cache hit.
[2023-03-21 21:34:30] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 141/141 places, 148/148 transitions.
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.8 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2843755 steps, run timeout after 3001 ms. (steps per millisecond=947 ) properties seen :{}
Probabilistic random walk after 2843755 steps, saw 528766 distinct states, run finished after 3001 ms. (steps per millisecond=947 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 21:34:34] [INFO ] Invariant cache hit.
[2023-03-21 21:34:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 21:34:34] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:34:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 21:34:34] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:34:34] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-21 21:34:34] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 180 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=180 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 476 reset in 111 ms.
Product exploration explored 100000 steps with 475 reset in 134 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 148/148 transitions.
Graph (trivial) has 127 edges and 141 vertex of which 14 / 141 are part of one of the 1 SCC in 6 ms
Free SCC test removed 13 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 150 edges and 128 vertex of which 84 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 84 transition count 94
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 39 place count 84 transition count 94
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 84 transition count 94
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 75 place count 60 transition count 69
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 99 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 59 transition count 68
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 59 transition count 68
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 115 place count 59 transition count 68
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 133 place count 41 transition count 50
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 151 place count 41 transition count 50
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 159 place count 41 transition count 78
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 165 place count 41 transition count 72
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 176 place count 30 transition count 48
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 187 place count 30 transition count 48
Deduced a syphon composed of 18 places in 0 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 192 place count 30 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 193 place count 29 transition count 42
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 29 transition count 42
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 194 rules in 37 ms. Remains 29 /141 variables (removed 112) and now considering 42/148 (removed 106) transitions.
[2023-03-21 21:34:35] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 42 rows 29 cols
[2023-03-21 21:34:35] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 21:34:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/141 places, 42/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 29/141 places, 42/148 transitions.
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 141 cols
[2023-03-21 21:34:35] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 21:34:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-21 21:34:35] [INFO ] Invariant cache hit.
[2023-03-21 21:34:35] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-21 21:34:35] [INFO ] Invariant cache hit.
[2023-03-21 21:34:35] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 141/141 places, 148/148 transitions.
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-01 finished in 10465 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 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Graph (complete) has 180 edges and 154 vertex of which 110 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 108 transition count 54
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 34 edges and 42 vertex of which 5 / 42 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 38 transition count 53
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 141 place count 38 transition count 47
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 141 place count 38 transition count 34
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 167 place count 25 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 24 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 24 transition count 33
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 183 place count 17 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 17 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
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 192 place count 14 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 195 place count 14 transition count 25
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 13 transition count 19
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 13 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 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 199 place count 12 transition count 17
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 200 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 201 place count 10 transition count 16
Applied a total of 201 rules in 16 ms. Remains 10 /154 variables (removed 144) and now considering 16/160 (removed 144) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 21:34:35] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:34:35] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 21:34:35] [INFO ] Invariant cache hit.
[2023-03-21 21:34:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 21:34:35] [INFO ] Implicit Places using invariants and state equation in 27 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 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/154 places, 15/160 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 9 transition count 14
Applied a total of 1 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-21 21:34:35] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:34:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-21 21:34:35] [INFO ] Invariant cache hit.
[2023-03-21 21:34:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 21:34:35] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/154 places, 14/160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 9/154 places, 14/160 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s2)], 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 4 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-02 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1&&X(G((p1||G((p2 U p3))))))))))'
Support contains 7 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 160
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 145 transition count 153
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 145 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 145 transition count 152
Applied a total of 17 rules in 10 ms. Remains 145 /154 variables (removed 9) and now considering 152/160 (removed 8) transitions.
// Phase 1: matrix 152 rows 145 cols
[2023-03-21 21:34:35] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-21 21:34:35] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-21 21:34:35] [INFO ] Invariant cache hit.
[2023-03-21 21:34:36] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-21 21:34:36] [INFO ] Invariant cache hit.
[2023-03-21 21:34:36] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/154 places, 152/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 145/154 places, 152/160 transitions.
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 1} source=4 dest: 5}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={1} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=6 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=6 dest: 5}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT s4 s60), p1:(LEQ s45 s43), p3:(LEQ 1 s27), p2:(GT s127 s7)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5451 reset in 213 ms.
Product exploration explored 100000 steps with 5456 reset in 196 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 167 edges and 145 vertex of which 97 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/145 stabilizing places and 65/152 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 524 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :7
Finished Best-First random walk after 4460 steps, including 3 resets, run visited all 2 properties in 12 ms. (steps per millisecond=371 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p3) p2)), (F (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (F (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (F (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), (F (NOT (AND p1 (NOT p0)))), (F (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2))), (F (AND p1 (NOT p0) (NOT p3) p2))]
Knowledge based reduction with 10 factoid took 697 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 471 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 7 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-21 21:34:39] [INFO ] Invariant cache hit.
[2023-03-21 21:34:39] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-21 21:34:39] [INFO ] Invariant cache hit.
[2023-03-21 21:34:39] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-21 21:34:39] [INFO ] Invariant cache hit.
[2023-03-21 21:34:39] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 145/145 places, 152/152 transitions.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 167 edges and 145 vertex of which 97 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/145 stabilizing places and 65/152 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 503 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :7
Finished Best-First random walk after 4035 steps, including 2 resets, run visited all 2 properties in 8 ms. (steps per millisecond=504 )
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2 (NOT p3))), (F (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2) (AND (NOT p0) p3)))), (F (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (F (OR (AND (NOT p1) (NOT p0) p2) (AND (NOT p1) (NOT p0) p3))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (F (NOT (AND p1 (NOT p0)))), (F (OR (AND p1 (NOT p0) p2) (AND p1 (NOT p0) p3))), (F (AND p1 (NOT p0) p2 (NOT p3)))]
Knowledge based reduction with 10 factoid took 708 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 5402 reset in 140 ms.
Product exploration explored 100000 steps with 5411 reset in 261 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 7 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 152/152 transitions.
Graph (complete) has 167 edges and 145 vertex of which 116 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.2 ms
Discarding 29 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 116 transition count 126
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 46 place count 116 transition count 127
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 66 place count 116 transition count 127
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 98 place count 84 transition count 95
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 130 place count 84 transition count 95
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 145 place count 84 transition count 97
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 160 place count 69 transition count 82
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 175 place count 69 transition count 82
Performed 12 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 187 place count 69 transition count 126
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 196 place count 69 transition count 117
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 213 place count 52 transition count 76
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 230 place count 52 transition count 76
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 230 rules in 22 ms. Remains 52 /145 variables (removed 93) and now considering 76/152 (removed 76) transitions.
[2023-03-21 21:34:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 52 cols
[2023-03-21 21:34:43] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 21:34:43] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/145 places, 76/152 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 52/145 places, 76/152 transitions.
Support contains 7 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 152/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 145 cols
[2023-03-21 21:34:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 21:34:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-21 21:34:43] [INFO ] Invariant cache hit.
[2023-03-21 21:34:43] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-21 21:34:43] [INFO ] Invariant cache hit.
[2023-03-21 21:34:43] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 145/145 places, 152/152 transitions.
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-03 finished in 7601 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(G(p2)))))'
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 160
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 148 transition count 155
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 148 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 148 transition count 154
Applied a total of 12 rules in 8 ms. Remains 148 /154 variables (removed 6) and now considering 154/160 (removed 6) transitions.
// Phase 1: matrix 154 rows 148 cols
[2023-03-21 21:34:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 21:34:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-21 21:34:43] [INFO ] Invariant cache hit.
[2023-03-21 21:34:43] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-21 21:34:43] [INFO ] Invariant cache hit.
[2023-03-21 21:34:43] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/154 places, 154/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 148/154 places, 154/160 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s21 s143), p1:(LEQ s138 s85), p2:(AND (LEQ s138 s85) (LEQ s129 s44))], 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 2527 reset in 128 ms.
Product exploration explored 100000 steps with 2814 reset in 134 ms.
Computed a total of 63 stabilizing places and 67 stable transitions
Graph (complete) has 171 edges and 148 vertex of which 99 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.4 ms
Computed a total of 63 stabilizing places and 67 stable transitions
Detected a total of 63/148 stabilizing places and 67/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 471 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 487 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 4 out of 148 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 154/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-21 21:34:45] [INFO ] Invariant cache hit.
[2023-03-21 21:34:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-21 21:34:45] [INFO ] Invariant cache hit.
[2023-03-21 21:34:45] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-21 21:34:45] [INFO ] Invariant cache hit.
[2023-03-21 21:34:45] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 148/148 places, 154/154 transitions.
Computed a total of 63 stabilizing places and 67 stable transitions
Graph (complete) has 171 edges and 148 vertex of which 99 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 67 stable transitions
Knowledge obtained : [(AND p2 p1), (X (NOT p2)), (X (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p2 p1), (X (NOT p2)), (X (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 349 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 2559 reset in 126 ms.
Product exploration explored 100000 steps with 2832 reset in 131 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 154/154 transitions.
Graph (complete) has 171 edges and 148 vertex of which 104 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
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 104 transition count 114
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 45 place count 104 transition count 114
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 61 place count 104 transition count 114
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 93 place count 72 transition count 81
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 125 place count 72 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 72 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 70 transition count 79
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 70 transition count 79
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 146 place count 70 transition count 79
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 167 place count 49 transition count 58
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 188 place count 49 transition count 58
Performed 10 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 198 place count 49 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 203 place count 49 transition count 98
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 216 place count 36 transition count 61
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 229 place count 36 transition count 61
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 229 rules in 19 ms. Remains 36 /148 variables (removed 112) and now considering 61/154 (removed 93) transitions.
[2023-03-21 21:34:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 36 cols
[2023-03-21 21:34:47] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 21:34:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/148 places, 61/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 36/148 places, 61/154 transitions.
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 154/154 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 153
Applied a total of 2 rules in 2 ms. Remains 147 /148 variables (removed 1) and now considering 153/154 (removed 1) transitions.
// Phase 1: matrix 153 rows 147 cols
[2023-03-21 21:34:47] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 21:34:47] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-21 21:34:47] [INFO ] Invariant cache hit.
[2023-03-21 21:34:47] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-21 21:34:47] [INFO ] Invariant cache hit.
[2023-03-21 21:34:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/148 places, 153/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 147/148 places, 153/154 transitions.
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-05 finished in 4354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U X(p1)))||G(!p1)))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 144 transition count 152
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 144 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 143 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 142 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 141 transition count 148
Applied a total of 25 rules in 8 ms. Remains 141 /154 variables (removed 13) and now considering 148/160 (removed 12) transitions.
// Phase 1: matrix 148 rows 141 cols
[2023-03-21 21:34:47] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 21:34:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-21 21:34:47] [INFO ] Invariant cache hit.
[2023-03-21 21:34:48] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-21 21:34:48] [INFO ] Invariant cache hit.
[2023-03-21 21:34:48] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/154 places, 148/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 141/154 places, 148/160 transitions.
Stuttering acceptance computed with spot in 319 ms :[false, (NOT p1), true, (NOT p1), (NOT p1), false, false, false, p1]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 6}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 1}], [{ cond=p1, acceptance={} source=8 dest: 2}, { cond=(NOT p1), acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(LEQ s42 s66), p0:(LEQ s30 s37)], 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Product exploration explored 100000 steps with 33333 reset in 136 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 p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 10 factoid took 211 ms. Reduced automaton from 9 states, 17 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-08 finished in 1019 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||G(p1)))))'
Support contains 5 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 160
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 146 transition count 154
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 146 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 145 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 145 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 144 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 144 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 143 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 143 transition count 151
Applied a total of 20 rules in 11 ms. Remains 143 /154 variables (removed 11) and now considering 151/160 (removed 9) transitions.
// Phase 1: matrix 151 rows 143 cols
[2023-03-21 21:34:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 21:34:48] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-21 21:34:48] [INFO ] Invariant cache hit.
[2023-03-21 21:34:49] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-21 21:34:49] [INFO ] Invariant cache hit.
[2023-03-21 21:34:49] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/154 places, 151/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 143/154 places, 151/160 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (GT 3 s135) (GT s42 s30)), p0:(AND (GT 3 s135) (LEQ s133 s50))], 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]]
Product exploration explored 100000 steps with 445 reset in 212 ms.
Product exploration explored 100000 steps with 448 reset in 176 ms.
Computed a total of 62 stabilizing places and 67 stable transitions
Graph (complete) has 168 edges and 143 vertex of which 98 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Computed a total of 62 stabilizing places and 67 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 313 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 21:34:50] [INFO ] Invariant cache hit.
[2023-03-21 21:34:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 21:34:50] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-21 21:34:50] [INFO ] After 64ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:34:50] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:34:50] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-21 21:34:50] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 21:34:50] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-21 21:34:50] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 416 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=59 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 390 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 151/151 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2023-03-21 21:34:50] [INFO ] Invariant cache hit.
[2023-03-21 21:34:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-21 21:34:51] [INFO ] Invariant cache hit.
[2023-03-21 21:34:51] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-21 21:34:51] [INFO ] Invariant cache hit.
[2023-03-21 21:34:51] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 143/143 places, 151/151 transitions.
Computed a total of 62 stabilizing places and 67 stable transitions
Graph (complete) has 168 edges and 143 vertex of which 98 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Computed a total of 62 stabilizing places and 67 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 361 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10001 steps, including 42 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Finished Best-First random walk after 9502 steps, including 4 resets, run visited all 2 properties in 16 ms. (steps per millisecond=593 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 402 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 447 reset in 123 ms.
Product exploration explored 100000 steps with 453 reset in 125 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 151/151 transitions.
Graph (trivial) has 123 edges and 143 vertex of which 12 / 143 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 156 edges and 132 vertex of which 120 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 120 transition count 128
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 47 place count 120 transition count 130
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 68 place count 120 transition count 130
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 95 place count 93 transition count 103
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 122 place count 93 transition count 103
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 141 place count 93 transition count 105
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 162 place count 72 transition count 84
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 183 place count 72 transition count 84
Performed 7 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 190 place count 72 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 194 place count 72 transition count 108
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 204 place count 62 transition count 86
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 214 place count 62 transition count 86
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 214 rules in 17 ms. Remains 62 /143 variables (removed 81) and now considering 86/151 (removed 65) transitions.
[2023-03-21 21:34:52] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 86 rows 62 cols
[2023-03-21 21:34:52] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-21 21:34:53] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/143 places, 86/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 62/143 places, 86/151 transitions.
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 151/151 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 143 cols
[2023-03-21 21:34:53] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-21 21:34:53] [INFO ] Invariant cache hit.
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-21 21:34:53] [INFO ] Invariant cache hit.
[2023-03-21 21:34:53] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 143/143 places, 151/151 transitions.
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-09 finished in 4344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Graph (complete) has 180 edges and 154 vertex of which 113 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 36 output transitions
Drop transitions removed 36 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 111 transition count 51
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 33 edges and 39 vertex of which 5 / 39 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 74 rules applied. Total rules applied 147 place count 35 transition count 50
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 153 place count 35 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 153 place count 35 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 173 place count 25 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 24 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 24 transition count 33
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 187 place count 18 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 18 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
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 195 place count 15 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 197 place count 15 transition count 25
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 14 transition count 21
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 201 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 13 transition count 18
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 203 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 11 transition count 17
Applied a total of 204 rules in 13 ms. Remains 11 /154 variables (removed 143) and now considering 17/160 (removed 143) transitions.
// Phase 1: matrix 17 rows 11 cols
[2023-03-21 21:34:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-21 21:34:53] [INFO ] Invariant cache hit.
[2023-03-21 21:34:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants and state equation in 27 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/154 places, 17/160 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 15
Applied a total of 2 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-03-21 21:34:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-21 21:34:53] [INFO ] Invariant cache hit.
[2023-03-21 21:34:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/154 places, 15/160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 111 ms. Remains : 10/154 places, 15/160 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-11 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:(GT s7 s4)], 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 3 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-11 finished in 201 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 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Graph (complete) has 180 edges and 154 vertex of which 117 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 115 transition count 56
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 34 edges and 45 vertex of which 5 / 45 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 41 transition count 55
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 149 place count 41 transition count 49
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 149 place count 41 transition count 36
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 176 place count 27 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 26 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 26 transition count 35
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 194 place count 18 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 196 place count 18 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 200 place count 16 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 201 place count 16 transition count 28
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 202 place count 15 transition count 22
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 15 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 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 206 place count 14 transition count 19
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 207 place count 13 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 208 place count 12 transition count 18
Applied a total of 208 rules in 13 ms. Remains 12 /154 variables (removed 142) and now considering 18/160 (removed 142) transitions.
// Phase 1: matrix 18 rows 12 cols
[2023-03-21 21:34:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 21:34:53] [INFO ] Invariant cache hit.
[2023-03-21 21:34:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned [5]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/154 places, 17/160 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-21 21:34:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-21 21:34:53] [INFO ] Invariant cache hit.
[2023-03-21 21:34:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/154 places, 16/160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 11/154 places, 16/160 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-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:(LEQ s3 s4), p1:(LEQ 1 s2)], 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 32 steps with 1 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-12 finished in 166 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((G(p1)||p0))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 144 transition count 152
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 144 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 143 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 142 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 141 transition count 148
Applied a total of 25 rules in 9 ms. Remains 141 /154 variables (removed 13) and now considering 148/160 (removed 12) transitions.
// Phase 1: matrix 148 rows 141 cols
[2023-03-21 21:34:53] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-21 21:34:53] [INFO ] Invariant cache hit.
[2023-03-21 21:34:53] [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.
[2023-03-21 21:34:53] [INFO ] Invariant cache hit.
[2023-03-21 21:34:53] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/154 places, 148/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 141/154 places, 148/160 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s76 s47), p0:(OR (LEQ 2 s84) (AND (LEQ s76 s47) (GT 1 s44)))], 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 168 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-13 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 160
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 145 transition count 153
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 145 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 145 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 144 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 143 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 142 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 142 transition count 149
Applied a total of 23 rules in 9 ms. Remains 142 /154 variables (removed 12) and now considering 149/160 (removed 11) transitions.
// Phase 1: matrix 149 rows 142 cols
[2023-03-21 21:34:53] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 21:34:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-21 21:34:53] [INFO ] Invariant cache hit.
[2023-03-21 21:34:54] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-21 21:34:54] [INFO ] Invariant cache hit.
[2023-03-21 21:34:54] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/154 places, 149/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 142/154 places, 149/160 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-14 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}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ 2 s138), p0:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 469 reset in 104 ms.
Product exploration explored 100000 steps with 467 reset in 108 ms.
Computed a total of 62 stabilizing places and 66 stable transitions
Graph (complete) has 165 edges and 142 vertex of which 98 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Computed a total of 62 stabilizing places and 66 stable transitions
Detected a total of 62/142 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 p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 299 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 142 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 : 142/142 places, 149/149 transitions.
Graph (trivial) has 127 edges and 142 vertex of which 18 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 146 edges and 125 vertex of which 81 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 80 transition count 43
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 34 transition count 43
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 94 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 2 with 22 rules applied. Total rules applied 116 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 2 with 16 rules applied. Total rules applied 132 place count 15 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 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 3 with 4 rules applied. Total rules applied 138 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 13 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 13 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 12 transition count 17
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 144 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 10 transition count 16
Applied a total of 145 rules in 14 ms. Remains 10 /142 variables (removed 132) and now considering 16/149 (removed 133) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 21:34:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:34:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 21:34:55] [INFO ] Invariant cache hit.
[2023-03-21 21:34:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 21:34:55] [INFO ] Implicit Places using invariants and state equation in 26 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 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/142 places, 15/149 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 9/142 places, 15/149 transitions.
Computed a total of 5 stabilizing places and 8 stable transitions
Computed a total of 5 stabilizing places and 8 stable transitions
Detected a total of 5/9 stabilizing places and 8/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 124 steps with 5 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-14 finished in 1570 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||X((X(G(p1)) U (p0&&X(G(p1))))))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 144 transition count 152
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 144 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 143 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 142 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 141 transition count 148
Applied a total of 25 rules in 16 ms. Remains 141 /154 variables (removed 13) and now considering 148/160 (removed 12) transitions.
// Phase 1: matrix 148 rows 141 cols
[2023-03-21 21:34:55] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-21 21:34:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-21 21:34:55] [INFO ] Invariant cache hit.
[2023-03-21 21:34:55] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-21 21:34:55] [INFO ] Invariant cache hit.
[2023-03-21 21:34:55] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/154 places, 148/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 141/154 places, 148/160 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s72), p1:(LEQ s84 s63)], 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]]
Entered a terminal (fully accepting) state of product in 162 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-15 finished in 369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p1&&X(X(F(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1&&X(G((p1||G((p2 U p3))))))))))'
Found a Shortening insensitive property : IBMB2S565S3960-PT-none-LTLCardinality-03
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 7 out of 154 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Graph (complete) has 180 edges and 154 vertex of which 123 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 121 transition count 68
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 132 place count 57 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 55 transition count 65
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 134 place count 55 transition count 49
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 167 place count 38 transition count 49
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 37 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 37 transition count 48
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 193 place count 25 transition count 35
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 25 transition count 31
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 201 place count 23 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 22 transition count 29
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 21 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 20 transition count 28
Applied a total of 204 rules in 11 ms. Remains 20 /154 variables (removed 134) and now considering 28/160 (removed 132) transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-03-21 21:34:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:34:56] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 21:34:56] [INFO ] Invariant cache hit.
[2023-03-21 21:34:56] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-21 21:34:56] [INFO ] Invariant cache hit.
[2023-03-21 21:34:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 20/154 places, 28/160 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 89 ms. Remains : 20/154 places, 28/160 transitions.
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 1} source=4 dest: 5}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={1} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=6 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=6 dest: 5}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT s0 s8), p1:(LEQ s7 s6), p3:(LEQ 1 s5), p2:(GT s15 s2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32127 reset in 81 ms.
Product exploration explored 100000 steps with 32248 reset in 81 ms.
Computed a total of 10 stabilizing places and 14 stable transitions
Graph (complete) has 30 edges and 20 vertex of which 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 14 stable transitions
Detected a total of 10/20 stabilizing places and 14/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))))]
Knowledge based reduction with 7 factoid took 530 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Finished random walk after 2088 steps, including 35 resets, run visited all 9 properties in 13 ms. (steps per millisecond=160 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))))), (F (AND (NOT p1) (NOT p0) (NOT p3) p2)), (F (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (F (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (F (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), (F (NOT (AND p1 (NOT p0)))), (F (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2))), (F (AND p1 (NOT p0) (NOT p3) p2))]
Knowledge based reduction with 7 factoid took 664 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 423 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 7 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-21 21:34:58] [INFO ] Invariant cache hit.
[2023-03-21 21:34:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 21:34:58] [INFO ] Invariant cache hit.
[2023-03-21 21:34:58] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-21 21:34:58] [INFO ] Invariant cache hit.
[2023-03-21 21:34:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 20/20 places, 28/28 transitions.
Computed a total of 10 stabilizing places and 14 stable transitions
Graph (complete) has 30 edges and 20 vertex of which 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 14 stable transitions
Detected a total of 10/20 stabilizing places and 14/28 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 7 factoid took 484 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 448 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Finished random walk after 5504 steps, including 99 resets, run visited all 9 properties in 31 ms. (steps per millisecond=177 )
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0) p2 (NOT p3))), (F (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2) (AND (NOT p0) p3)))), (F (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (F (OR (AND (NOT p1) (NOT p0) p2) (AND (NOT p1) (NOT p0) p3))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))), (F (NOT (AND p1 (NOT p0)))), (F (OR (AND p1 (NOT p0) p2) (AND p1 (NOT p0) p3))), (F (AND p1 (NOT p0) p2 (NOT p3)))]
Knowledge based reduction with 7 factoid took 832 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 32060 reset in 70 ms.
Product exploration explored 100000 steps with 32086 reset in 79 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 7 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-21 21:35:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:35:02] [INFO ] Invariant cache hit.
[2023-03-21 21:35:02] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43 ms. Remains : 20/20 places, 28/28 transitions.
Support contains 7 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-03-21 21:35:02] [INFO ] Invariant cache hit.
[2023-03-21 21:35:02] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-21 21:35:02] [INFO ] Invariant cache hit.
[2023-03-21 21:35:02] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-21 21:35:02] [INFO ] Invariant cache hit.
[2023-03-21 21:35:02] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 20/20 places, 28/28 transitions.
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-03 finished in 6316 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(G(p2)))))'
Found a Lengthening insensitive property : IBMB2S565S3960-PT-none-LTLCardinality-05
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Graph (complete) has 180 edges and 154 vertex of which 109 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 41 output transitions
Drop transitions removed 41 transitions
Ensure Unique test removed 1 places
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 108 transition count 58
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 47 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 46 transition count 56
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 126 place count 46 transition count 43
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 152 place count 33 transition count 43
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 177 place count 20 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 180 place count 20 transition count 28
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 184 place count 18 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 185 place count 18 transition count 25
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 187 place count 17 transition count 26
Applied a total of 187 rules in 4 ms. Remains 17 /154 variables (removed 137) and now considering 26/160 (removed 134) transitions.
// Phase 1: matrix 26 rows 17 cols
[2023-03-21 21:35:02] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:35:02] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-21 21:35:02] [INFO ] Invariant cache hit.
[2023-03-21 21:35:02] [INFO ] Implicit Places using invariants and state equation in 25 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 59 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/154 places, 25/160 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 63 ms. Remains : 16/154 places, 25/160 transitions.
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s3 s15), p1:(LEQ s13 s5), p2:(AND (LEQ s13 s5) (LEQ s9 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8019 reset in 87 ms.
Stack based approach found an accepted trace after 12871 steps with 1043 reset with depth 20 and stack size 20 in 13 ms.
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-05 finished in 416 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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||G(p1)))))'
Found a Lengthening insensitive property : IBMB2S565S3960-PT-none-LTLCardinality-09
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 154 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 154/154 places, 160/160 transitions.
Graph (complete) has 180 edges and 154 vertex of which 136 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 134 transition count 68
Reduce places removed 75 places and 0 transitions.
Graph (trivial) has 38 edges and 59 vertex of which 3 / 59 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 57 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 156 place count 57 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 157 place count 56 transition count 64
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 157 place count 56 transition count 46
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 195 place count 36 transition count 46
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 4 with 3 rules applied. Total rules applied 198 place count 35 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 200 place count 33 transition count 44
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 201 place count 32 transition count 43
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 32 transition count 43
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 218 place count 24 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 220 place count 24 transition count 33
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 226 place count 21 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 228 place count 21 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 229 place count 20 transition count 35
Ensure Unique test removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 230 place count 19 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 231 place count 18 transition count 34
Applied a total of 231 rules in 15 ms. Remains 18 /154 variables (removed 136) and now considering 34/160 (removed 126) transitions.
// Phase 1: matrix 34 rows 18 cols
[2023-03-21 21:35:02] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:35:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-21 21:35:02] [INFO ] Invariant cache hit.
[2023-03-21 21:35:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 21:35:02] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [8]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/154 places, 33/160 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 119 ms. Remains : 17/154 places, 33/160 transitions.
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (GT 3 s15) (GT s5 s4)), p0:(AND (GT 3 s15) (LEQ s13 s7))], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3927 reset in 128 ms.
Product exploration explored 100000 steps with 3938 reset in 167 ms.
Computed a total of 7 stabilizing places and 18 stable transitions
Graph (complete) has 26 edges and 17 vertex of which 12 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 341 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :2
Finished Best-First random walk after 3262 steps, including 19 resets, run visited all 2 properties in 6 ms. (steps per millisecond=543 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 17 cols
[2023-03-21 21:35:04] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:35:04] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-21 21:35:04] [INFO ] Invariant cache hit.
[2023-03-21 21:35:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 21:35:04] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-21 21:35:04] [INFO ] Invariant cache hit.
[2023-03-21 21:35:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 17/17 places, 33/33 transitions.
Computed a total of 7 stabilizing places and 18 stable transitions
Graph (complete) has 26 edges and 17 vertex of which 12 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 395 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 341 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :2
Finished Best-First random walk after 759 steps, including 4 resets, run visited all 2 properties in 2 ms. (steps per millisecond=379 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 324 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3922 reset in 103 ms.
Entered a terminal (fully accepting) state of product in 86735 steps with 3406 reset in 136 ms.
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-09 finished in 3227 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-21 21:35:05] [INFO ] Flatten gal took : 7 ms
[2023-03-21 21:35:05] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-21 21:35:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 160 transitions and 341 arcs took 2 ms.
Total runtime 44369 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT IBMB2S565S3960-PT-none
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLCardinality

FORMULA IBMB2S565S3960-PT-none-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IBMB2S565S3960-PT-none-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IBMB2S565S3960-PT-none-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679434567983

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 IBMB2S565S3960-PT-none-LTLCardinality-01
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/720 6/32 IBMB2S565S3960-PT-none-LTLCardinality-01 771353 m, 154270 m/sec, 3643561 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/720 11/32 IBMB2S565S3960-PT-none-LTLCardinality-01 1520855 m, 149900 m/sec, 7127503 t fired, .

Time elapsed: 10 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/720 16/32 IBMB2S565S3960-PT-none-LTLCardinality-01 2146722 m, 125173 m/sec, 10467471 t fired, .

Time elapsed: 15 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/720 20/32 IBMB2S565S3960-PT-none-LTLCardinality-01 2678604 m, 106376 m/sec, 13546857 t fired, .

Time elapsed: 20 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 1 (type EXCL) for IBMB2S565S3960-PT-none-LTLCardinality-01
lola: result : false
lola: markings : 2985666
lola: fired transitions : 15148352
lola: time used : 23.000000
lola: memory pages used : 22
lola: LAUNCH task # 14 (type EXCL) for 13 IBMB2S565S3960-PT-none-LTLCardinality-09
lola: time limit : 894 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 2/894 4/32 IBMB2S565S3960-PT-none-LTLCardinality-09 460667 m, 92133 m/sec, 1862228 t fired, .

Time elapsed: 25 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 7/894 9/32 IBMB2S565S3960-PT-none-LTLCardinality-09 1242563 m, 156379 m/sec, 5488224 t fired, .

Time elapsed: 30 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 12/894 13/32 IBMB2S565S3960-PT-none-LTLCardinality-09 1889487 m, 129384 m/sec, 9028335 t fired, .

Time elapsed: 35 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 17/894 18/32 IBMB2S565S3960-PT-none-LTLCardinality-09 2618204 m, 145743 m/sec, 12517462 t fired, .

Time elapsed: 40 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 22/894 24/32 IBMB2S565S3960-PT-none-LTLCardinality-09 3386541 m, 153667 m/sec, 15912555 t fired, .

Time elapsed: 45 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 27/894 28/32 IBMB2S565S3960-PT-none-LTLCardinality-09 4000749 m, 122841 m/sec, 19179203 t fired, .

Time elapsed: 50 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 32/894 32/32 IBMB2S565S3960-PT-none-LTLCardinality-09 4571111 m, 114072 m/sec, 22425110 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 14 (type EXCL) for IBMB2S565S3960-PT-none-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 11 (type EXCL) for 6 IBMB2S565S3960-PT-none-LTLCardinality-05
lola: time limit : 1180 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for IBMB2S565S3960-PT-none-LTLCardinality-05
lola: result : false
lola: markings : 14767
lola: fired transitions : 48278
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 IBMB2S565S3960-PT-none-LTLCardinality-03
lola: time limit : 3539 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for IBMB2S565S3960-PT-none-LTLCardinality-03
lola: result : true
lola: markings : 194161
lola: fired transitions : 715576
lola: time used : 0.000000
lola: memory pages used : 2
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IBMB2S565S3960-PT-none-LTLCardinality-01: LTL false LTL model checker
IBMB2S565S3960-PT-none-LTLCardinality-03: LTL true LTL model checker
IBMB2S565S3960-PT-none-LTLCardinality-05: CONJ false LTL model checker
IBMB2S565S3960-PT-none-LTLCardinality-09: LTL unknown AGGR


Time elapsed: 61 secs. Pages in use: 32

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="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is IBMB2S565S3960-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r231-tall-167856415600099"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;