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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K 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 DES-PT-20b-LTLFireability-00
FORMULA_NAME DES-PT-20b-LTLFireability-01
FORMULA_NAME DES-PT-20b-LTLFireability-02
FORMULA_NAME DES-PT-20b-LTLFireability-03
FORMULA_NAME DES-PT-20b-LTLFireability-04
FORMULA_NAME DES-PT-20b-LTLFireability-05
FORMULA_NAME DES-PT-20b-LTLFireability-06
FORMULA_NAME DES-PT-20b-LTLFireability-07
FORMULA_NAME DES-PT-20b-LTLFireability-08
FORMULA_NAME DES-PT-20b-LTLFireability-09
FORMULA_NAME DES-PT-20b-LTLFireability-10
FORMULA_NAME DES-PT-20b-LTLFireability-11
FORMULA_NAME DES-PT-20b-LTLFireability-12
FORMULA_NAME DES-PT-20b-LTLFireability-13
FORMULA_NAME DES-PT-20b-LTLFireability-14
FORMULA_NAME DES-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678299101834

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 18:11:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 18:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:11:43] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-08 18:11:43] [INFO ] Transformed 360 places.
[2023-03-08 18:11:43] [INFO ] Transformed 311 transitions.
[2023-03-08 18:11:43] [INFO ] Found NUPN structural information;
[2023-03-08 18:11:43] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-20b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 357 transition count 311
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 337 transition count 291
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 337 transition count 291
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 325 transition count 279
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 325 transition count 279
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 325 transition count 270
Applied a total of 76 rules in 70 ms. Remains 325 /360 variables (removed 35) and now considering 270/311 (removed 41) transitions.
// Phase 1: matrix 270 rows 325 cols
[2023-03-08 18:11:43] [INFO ] Computed 62 place invariants in 37 ms
[2023-03-08 18:11:44] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-08 18:11:44] [INFO ] Invariant cache hit.
[2023-03-08 18:11:44] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2023-03-08 18:11:44] [INFO ] Invariant cache hit.
[2023-03-08 18:11:44] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 325/360 places, 270/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1119 ms. Remains : 325/360 places, 270/311 transitions.
Support contains 49 out of 325 places after structural reductions.
[2023-03-08 18:11:44] [INFO ] Flatten gal took : 49 ms
[2023-03-08 18:11:44] [INFO ] Flatten gal took : 25 ms
[2023-03-08 18:11:45] [INFO ] Input system was already deterministic with 270 transitions.
Support contains 46 out of 325 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 28) seen :22
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 18:11:45] [INFO ] Invariant cache hit.
[2023-03-08 18:11:45] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2023-03-08 18:11:45] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 19 ms returned sat
[2023-03-08 18:11:46] [INFO ] After 247ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-08 18:11:46] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 10 ms to minimize.
[2023-03-08 18:11:46] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-08 18:11:46] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2023-03-08 18:11:46] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2023-03-08 18:11:46] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2023-03-08 18:11:46] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2023-03-08 18:11:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 501 ms
[2023-03-08 18:11:46] [INFO ] After 844ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 18:11:46] [INFO ] After 1158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 18:11:47] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 18:11:47] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 16 ms returned sat
[2023-03-08 18:11:47] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 18:11:47] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-08 18:11:47] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-03-08 18:11:47] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-03-08 18:11:47] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-03-08 18:11:47] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-08 18:11:47] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2023-03-08 18:11:47] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2023-03-08 18:11:47] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2023-03-08 18:11:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 480 ms
[2023-03-08 18:11:47] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2023-03-08 18:11:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-08 18:11:48] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2023-03-08 18:11:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-08 18:11:48] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2023-03-08 18:11:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 18:11:48] [INFO ] After 1066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-08 18:11:48] [INFO ] After 1398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 391 ms.
Support contains 9 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 323 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 323 transition count 248
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 305 transition count 248
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 39 place count 305 transition count 237
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 61 place count 294 transition count 237
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 288 transition count 231
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 288 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 76 place count 288 transition count 228
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 287 transition count 227
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 80 place count 285 transition count 225
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 285 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 285 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 84 place count 285 transition count 222
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 86 place count 284 transition count 222
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 238 place count 208 transition count 146
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 5 with 4 rules applied. Total rules applied 242 place count 206 transition count 148
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 206 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 205 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 204 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 246 place count 203 transition count 146
Applied a total of 246 rules in 103 ms. Remains 203 /325 variables (removed 122) and now considering 146/270 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 203/325 places, 146/270 transitions.
Incomplete random walk after 10000 steps, including 433 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 918361 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 918361 steps, saw 128668 distinct states, run finished after 3002 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 146 rows 203 cols
[2023-03-08 18:11:52] [INFO ] Computed 63 place invariants in 5 ms
[2023-03-08 18:11:52] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 18:11:52] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 16 ms returned sat
[2023-03-08 18:11:52] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 18:11:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:11:52] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 18:11:52] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 18:11:52] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-08 18:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-08 18:11:52] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-08 18:11:53] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 107 ms.
Support contains 9 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 146/146 transitions.
Applied a total of 0 rules in 8 ms. Remains 203 /203 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 203/203 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 146/146 transitions.
Applied a total of 0 rules in 7 ms. Remains 203 /203 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2023-03-08 18:11:53] [INFO ] Invariant cache hit.
[2023-03-08 18:11:53] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-08 18:11:53] [INFO ] Invariant cache hit.
[2023-03-08 18:11:53] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-08 18:11:53] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 18:11:53] [INFO ] Invariant cache hit.
[2023-03-08 18:11:53] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 660 ms. Remains : 203/203 places, 146/146 transitions.
Applied a total of 0 rules in 13 ms. Remains 203 /203 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-08 18:11:53] [INFO ] Invariant cache hit.
[2023-03-08 18:11:53] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:11:53] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 16 ms returned sat
[2023-03-08 18:11:53] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 18:11:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 18:11:54] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 18:11:54] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 18:11:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2023-03-08 18:11:54] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-08 18:11:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-03-08 18:11:54] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-08 18:11:54] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 139 stabilizing places and 131 stable transitions
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 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||G((F(p1) U p2)))))'
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 318 transition count 250
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 302 transition count 250
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 302 transition count 238
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 290 transition count 238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 284 transition count 232
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 284 transition count 230
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 282 transition count 228
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 282 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 282 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 282 transition count 225
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 281 transition count 225
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 225 place count 208 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 207 transition count 152
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 207 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 205 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 204 transition count 150
Applied a total of 232 rules in 68 ms. Remains 204 /325 variables (removed 121) and now considering 150/270 (removed 120) transitions.
// Phase 1: matrix 150 rows 204 cols
[2023-03-08 18:11:54] [INFO ] Computed 58 place invariants in 18 ms
[2023-03-08 18:11:55] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-08 18:11:55] [INFO ] Invariant cache hit.
[2023-03-08 18:11:55] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-08 18:11:55] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 18:11:55] [INFO ] Invariant cache hit.
[2023-03-08 18:11:55] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/325 places, 150/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 615 ms. Remains : 204/325 places, 150/270 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-20b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s115 1), p2:(AND (EQ s182 1) (EQ s200 1)), p1:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 25346 reset in 369 ms.
Product exploration explored 100000 steps with 25348 reset in 352 ms.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Detected a total of 98/204 stabilizing places and 93/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 469 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 64 steps, including 3 resets, run visited all 4 properties in 3 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p1) (NOT p0) p2)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 435 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-08 18:11:57] [INFO ] Invariant cache hit.
[2023-03-08 18:11:57] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 18:11:57] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 18:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:11:57] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-03-08 18:11:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:11:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 18:11:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 18:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:11:58] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2023-03-08 18:11:58] [INFO ] Computed and/alt/rep : 138/346/138 causal constraints (skipped 9 transitions) in 10 ms.
[2023-03-08 18:11:58] [INFO ] Added : 103 causal constraints over 21 iterations in 354 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 150/150 transitions.
Applied a total of 0 rules in 12 ms. Remains 204 /204 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2023-03-08 18:11:58] [INFO ] Invariant cache hit.
[2023-03-08 18:11:58] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-08 18:11:58] [INFO ] Invariant cache hit.
[2023-03-08 18:11:59] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-08 18:11:59] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-08 18:11:59] [INFO ] Invariant cache hit.
[2023-03-08 18:11:59] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 463 ms. Remains : 204/204 places, 150/150 transitions.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Detected a total of 98/204 stabilizing places and 93/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 379 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 35 steps, including 1 resets, run visited all 4 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p1) (NOT p0) p2)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 496 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-08 18:12:00] [INFO ] Invariant cache hit.
[2023-03-08 18:12:00] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 18:12:00] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 27 ms returned sat
[2023-03-08 18:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:00] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-08 18:12:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:12:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 18 ms returned sat
[2023-03-08 18:12:00] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 18:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:01] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2023-03-08 18:12:01] [INFO ] Computed and/alt/rep : 138/346/138 causal constraints (skipped 9 transitions) in 10 ms.
[2023-03-08 18:12:01] [INFO ] Added : 103 causal constraints over 21 iterations in 352 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25454 reset in 227 ms.
Product exploration explored 100000 steps with 25341 reset in 216 ms.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 150/150 transitions.
Applied a total of 0 rules in 6 ms. Remains 204 /204 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2023-03-08 18:12:02] [INFO ] Invariant cache hit.
[2023-03-08 18:12:02] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-08 18:12:02] [INFO ] Invariant cache hit.
[2023-03-08 18:12:02] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-03-08 18:12:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:12:02] [INFO ] Invariant cache hit.
[2023-03-08 18:12:02] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 564 ms. Remains : 204/204 places, 150/150 transitions.
Treatment of property DES-PT-20b-LTLFireability-01 finished in 8053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F((p0&&X(X(p1))))))))'
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 319 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 319 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 319 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 317 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 317 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 317 transition count 258
Applied a total of 20 rules in 20 ms. Remains 317 /325 variables (removed 8) and now considering 258/270 (removed 12) transitions.
// Phase 1: matrix 258 rows 317 cols
[2023-03-08 18:12:02] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-08 18:12:02] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 18:12:02] [INFO ] Invariant cache hit.
[2023-03-08 18:12:03] [INFO ] Implicit Places using invariants and state equation in 335 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 489 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 316/325 places, 258/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 517 ms. Remains : 316/325 places, 258/270 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s101 1), p1:(AND (OR (EQ s22 0) (EQ s172 0)) (EQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 92 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-02 finished in 734 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||X(p1)))))'
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 317 transition count 262
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 317 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 317 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 314 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 314 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 314 transition count 254
Applied a total of 27 rules in 18 ms. Remains 314 /325 variables (removed 11) and now considering 254/270 (removed 16) transitions.
// Phase 1: matrix 254 rows 314 cols
[2023-03-08 18:12:03] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 18:12:03] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-08 18:12:03] [INFO ] Invariant cache hit.
[2023-03-08 18:12:04] [INFO ] Implicit Places using invariants and state equation in 378 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 653 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/325 places, 254/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 678 ms. Remains : 313/325 places, 254/270 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s17 1) (EQ s169 1)), p0:(AND (EQ s208 1) (EQ s239 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-03 finished in 809 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 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 318 transition count 249
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 301 transition count 249
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 301 transition count 238
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 57 place count 290 transition count 238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 284 transition count 232
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 72 place count 284 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 283 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 281 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 281 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 281 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 281 transition count 223
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 82 place count 280 transition count 223
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 232 place count 205 transition count 148
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 5 with 4 rules applied. Total rules applied 236 place count 203 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 201 transition count 148
Applied a total of 238 rules in 44 ms. Remains 201 /325 variables (removed 124) and now considering 148/270 (removed 122) transitions.
// Phase 1: matrix 148 rows 201 cols
[2023-03-08 18:12:04] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 18:12:04] [INFO ] Implicit Places using invariants in 173 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/325 places, 148/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 223 ms. Remains : 200/325 places, 148/270 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 40100 reset in 322 ms.
Product exploration explored 100000 steps with 40032 reset in 340 ms.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Detected a total of 97/200 stabilizing places and 92/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
// Phase 1: matrix 148 rows 200 cols
[2023-03-08 18:12:05] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 18:12:05] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 18:12:05] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 18:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:06] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2023-03-08 18:12:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:12:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 18:12:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 97 ms returned sat
[2023-03-08 18:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:06] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-08 18:12:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 18:12:06] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2023-03-08 18:12:06] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-03-08 18:12:07] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 0 ms to minimize.
[2023-03-08 18:12:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2023-03-08 18:12:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 631 ms
[2023-03-08 18:12:07] [INFO ] Computed and/alt/rep : 135/429/135 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-08 18:12:07] [INFO ] Added : 25 causal constraints over 5 iterations in 105 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-08 18:12:07] [INFO ] Invariant cache hit.
[2023-03-08 18:12:07] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 18:12:07] [INFO ] Invariant cache hit.
[2023-03-08 18:12:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 18:12:07] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-08 18:12:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:12:07] [INFO ] Invariant cache hit.
[2023-03-08 18:12:07] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 583 ms. Remains : 200/200 places, 148/148 transitions.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Detected a total of 97/200 stabilizing places and 92/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-08 18:12:08] [INFO ] Invariant cache hit.
[2023-03-08 18:12:08] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 18:12:08] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 18:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:08] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2023-03-08 18:12:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 18:12:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 18:12:08] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 45 ms returned sat
[2023-03-08 18:12:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 18:12:09] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2023-03-08 18:12:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 18:12:09] [INFO ] [Nat]Added 6 Read/Feed constraints in 9 ms returned sat
[2023-03-08 18:12:09] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-08 18:12:09] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2023-03-08 18:12:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-03-08 18:12:09] [INFO ] Computed and/alt/rep : 135/429/135 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 18:12:09] [INFO ] Added : 25 causal constraints over 5 iterations in 138 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40000 reset in 342 ms.
Product exploration explored 100000 steps with 39995 reset in 335 ms.
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-08 18:12:10] [INFO ] Invariant cache hit.
[2023-03-08 18:12:10] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-08 18:12:10] [INFO ] Invariant cache hit.
[2023-03-08 18:12:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 18:12:10] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-08 18:12:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:12:10] [INFO ] Invariant cache hit.
[2023-03-08 18:12:10] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 682 ms. Remains : 200/200 places, 148/148 transitions.
Treatment of property DES-PT-20b-LTLFireability-04 finished in 6547 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 (G(p2)&&p1))))'
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 318 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 316 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 316 transition count 258
Applied a total of 21 rules in 39 ms. Remains 316 /325 variables (removed 9) and now considering 258/270 (removed 12) transitions.
// Phase 1: matrix 258 rows 316 cols
[2023-03-08 18:12:10] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-08 18:12:11] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-08 18:12:11] [INFO ] Invariant cache hit.
[2023-03-08 18:12:11] [INFO ] Implicit Places using invariants and state equation in 358 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 672 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 315/325 places, 258/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 315 /315 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 717 ms. Remains : 315/325 places, 258/270 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-20b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s137 1) (EQ s166 1)), p0:(AND (EQ s106 1) (EQ s162 1)), p2:(AND (EQ s137 1) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-05 finished in 998 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(G(p1)))))'
Support contains 2 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 318 transition count 250
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 302 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 301 transition count 249
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 35 place count 301 transition count 238
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 57 place count 290 transition count 238
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 63 place count 284 transition count 232
Iterating global reduction 3 with 6 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 72 place count 284 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 283 transition count 228
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 76 place count 281 transition count 226
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 281 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 80 place count 281 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 80 place count 281 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 82 place count 280 transition count 223
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 230 place count 206 transition count 149
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 6 with 4 rules applied. Total rules applied 234 place count 204 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 202 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 201 transition count 149
Applied a total of 237 rules in 68 ms. Remains 201 /325 variables (removed 124) and now considering 149/270 (removed 121) transitions.
// Phase 1: matrix 149 rows 201 cols
[2023-03-08 18:12:11] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 18:12:12] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 18:12:12] [INFO ] Invariant cache hit.
[2023-03-08 18:12:12] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-08 18:12:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:12:12] [INFO ] Invariant cache hit.
[2023-03-08 18:12:12] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/325 places, 149/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 598 ms. Remains : 201/325 places, 149/270 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s196 0), p1:(EQ s137 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4615 reset in 244 ms.
Product exploration explored 100000 steps with 4630 reset in 275 ms.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Detected a total of 98/201 stabilizing places and 93/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 433 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 273 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 p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Support contains 1 out of 201 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 : 201/201 places, 149/149 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2023-03-08 18:12:13] [INFO ] Invariant cache hit.
[2023-03-08 18:12:14] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-08 18:12:14] [INFO ] Invariant cache hit.
[2023-03-08 18:12:14] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2023-03-08 18:12:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:12:14] [INFO ] Invariant cache hit.
[2023-03-08 18:12:14] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 569 ms. Remains : 201/201 places, 149/149 transitions.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Detected a total of 98/201 stabilizing places and 93/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 230 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 34 ms :[(NOT p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 183 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 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4621 reset in 216 ms.
Product exploration explored 100000 steps with 4677 reset in 232 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 149/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 148
Applied a total of 2 rules in 6 ms. Remains 200 /201 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 200 cols
[2023-03-08 18:12:15] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 18:12:15] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 18:12:15] [INFO ] Invariant cache hit.
[2023-03-08 18:12:15] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-08 18:12:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 18:12:15] [INFO ] Invariant cache hit.
[2023-03-08 18:12:16] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/201 places, 148/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 475 ms. Remains : 200/201 places, 148/149 transitions.
Treatment of property DES-PT-20b-LTLFireability-07 finished in 4150 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&&F(p1))))))'
Support contains 5 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 318 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 316 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 316 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 316 transition count 257
Applied a total of 22 rules in 19 ms. Remains 316 /325 variables (removed 9) and now considering 257/270 (removed 13) transitions.
// Phase 1: matrix 257 rows 316 cols
[2023-03-08 18:12:16] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-08 18:12:16] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-08 18:12:16] [INFO ] Invariant cache hit.
[2023-03-08 18:12:16] [INFO ] Implicit Places using invariants and state equation in 362 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 540 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 315/325 places, 257/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 565 ms. Remains : 315/325 places, 257/270 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s247 0), p1:(AND (EQ s141 1) (OR (EQ s112 1) (AND (EQ s275 1) (EQ s293 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-08 finished in 735 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)||!p0) U (G(p1)||p2))))'
Support contains 5 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 318 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 316 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 316 transition count 258
Applied a total of 21 rules in 19 ms. Remains 316 /325 variables (removed 9) and now considering 258/270 (removed 12) transitions.
// Phase 1: matrix 258 rows 316 cols
[2023-03-08 18:12:16] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-08 18:12:17] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-08 18:12:17] [INFO ] Invariant cache hit.
[2023-03-08 18:12:17] [INFO ] Implicit Places using invariants and state equation in 300 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 731 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 315/325 places, 258/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 315 /315 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 763 ms. Remains : 315/325 places, 258/270 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, p0, (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s308 1), p1:(AND (EQ s291 1) (EQ s300 1)), p0:(AND (EQ s106 1) (EQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-09 finished in 990 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) U ((p1||F(p2)||G(p3)) U X(G(!p4)))))'
Support contains 12 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 319 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 319 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 319 transition count 263
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 316 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 316 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 316 transition count 257
Applied a total of 22 rules in 29 ms. Remains 316 /325 variables (removed 9) and now considering 257/270 (removed 13) transitions.
// Phase 1: matrix 257 rows 316 cols
[2023-03-08 18:12:17] [INFO ] Computed 62 place invariants in 2 ms
[2023-03-08 18:12:18] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-08 18:12:18] [INFO ] Invariant cache hit.
[2023-03-08 18:12:18] [INFO ] Implicit Places using invariants and state equation in 316 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 662 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 315/325 places, 257/270 transitions.
Applied a total of 0 rules in 4 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 695 ms. Remains : 315/325 places, 257/270 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) (NOT p3) p4), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p3))]
Running random walk in product with property : DES-PT-20b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p4), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p4), acceptance={} source=1 dest: 1}, { cond=p4, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) p3 (NOT p0) (NOT p4)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p4), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) p4), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s94 1) (EQ s98 1) (EQ s108 1) (EQ s109 1) (EQ s114 1) (EQ s120 1)), p2:(AND (EQ s19 1) (EQ s170 1)), p0:(EQ s93 1), p4:(AND (EQ s112 1) (EQ s2...], 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 33420 reset in 248 ms.
Product exploration explored 100000 steps with 33225 reset in 249 ms.
Computed a total of 137 stabilizing places and 130 stable transitions
Graph (complete) has 651 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 137 stabilizing places and 130 stable transitions
Detected a total of 137/315 stabilizing places and 130/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/5 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4) (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p0) p4))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p4))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p0) (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4))))), (X (NOT (AND (NOT p2) (NOT p0) p4))), (X (NOT p4)), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) p4)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p4)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0) (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1663 ms. Reduced automaton from 5 states, 13 edges and 5 AP (stutter sensitive) to 5 states, 13 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) (NOT p3) p4), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 257 rows 315 cols
[2023-03-08 18:12:21] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 18:12:21] [INFO ] [Real]Absence check using 32 positive place invariants in 91 ms returned sat
[2023-03-08 18:12:21] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-08 18:12:21] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4) (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p0) p4))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p4))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p0) (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4))))), (X (NOT (AND (NOT p2) (NOT p0) p4))), (X (NOT p4)), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) p4)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p4)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0) (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p2) p3 (NOT p0) p4)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3) (NOT p0) p4)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p3 (NOT p0) (NOT p1))), (F p4), (F (AND (NOT p2) p3 (NOT p0) (NOT p4) p1)), (F (AND (NOT p2) (NOT p3) (NOT p0) (NOT p4) p1)), (F (OR (AND (NOT p2) p3 (NOT p0) (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) p1))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) p4)), (F (AND (NOT p2) p3 (NOT p0))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0))))]
Knowledge based reduction with 26 factoid took 1701 ms. Reduced automaton from 5 states, 13 edges and 5 AP (stutter sensitive) to 4 states, 10 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p2) (NOT p0))]
Support contains 12 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 257/257 transitions.
Applied a total of 0 rules in 4 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2023-03-08 18:12:23] [INFO ] Invariant cache hit.
[2023-03-08 18:12:23] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 18:12:23] [INFO ] Invariant cache hit.
[2023-03-08 18:12:24] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-08 18:12:24] [INFO ] Invariant cache hit.
[2023-03-08 18:12:24] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 315/315 places, 257/257 transitions.
Computed a total of 137 stabilizing places and 130 stable transitions
Graph (complete) has 651 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 137 stabilizing places and 130 stable transitions
Detected a total of 137/315 stabilizing places and 130/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/5 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) p1))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p4) p1))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) p1)))), (X (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p4))), (X (NOT p4)), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p4) p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1024 ms. Reduced automaton from 4 states, 10 edges and 5 AP (stutter sensitive) to 4 states, 10 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Finished random walk after 2737 steps, including 23 resets, run visited all 8 properties in 7 ms. (steps per millisecond=391 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) p1))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p4) p1))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) p1)))), (X (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p4))), (X (NOT p4)), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p4) p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p3 (NOT p0) (NOT p2))), (F p4), (F (AND p1 p3 (NOT p0) (NOT p2) (NOT p4))), (F (AND p1 (NOT p3) (NOT p0) (NOT p2) (NOT p4))), (F (OR (AND p1 (NOT p0) (NOT p2) (NOT p4)) (AND p3 (NOT p0) (NOT p2) (NOT p4)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p2) p4)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 19 factoid took 1191 ms. Reduced automaton from 4 states, 10 edges and 5 AP (stutter sensitive) to 4 states, 10 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33374 reset in 242 ms.
Product exploration explored 100000 steps with 33384 reset in 245 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Support contains 12 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 257/257 transitions.
Graph (complete) has 651 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 310 transition count 254
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 15 place count 310 transition count 256
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 310 transition count 256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 305 transition count 251
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 305 transition count 251
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 100 place count 305 transition count 255
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 109 place count 296 transition count 246
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 118 place count 296 transition count 246
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 123 place count 296 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 294 transition count 260
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 294 transition count 260
Deduced a syphon composed of 78 places in 0 ms
Applied a total of 127 rules in 71 ms. Remains 294 /315 variables (removed 21) and now considering 260/257 (removed -3) transitions.
[2023-03-08 18:12:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 260 rows 294 cols
[2023-03-08 18:12:28] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 18:12:28] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/315 places, 260/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 334 ms. Remains : 294/315 places, 260/257 transitions.
Support contains 12 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 257/257 transitions.
Applied a total of 0 rules in 26 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 315 cols
[2023-03-08 18:12:28] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 18:12:28] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-08 18:12:28] [INFO ] Invariant cache hit.
[2023-03-08 18:12:29] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2023-03-08 18:12:29] [INFO ] Invariant cache hit.
[2023-03-08 18:12:29] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 821 ms. Remains : 315/315 places, 257/257 transitions.
Treatment of property DES-PT-20b-LTLFireability-10 finished in 11467 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 U X(p1)))))'
Support contains 2 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 318 transition count 261
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 315 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 315 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 315 transition count 255
Applied a total of 25 rules in 20 ms. Remains 315 /325 variables (removed 10) and now considering 255/270 (removed 15) transitions.
// Phase 1: matrix 255 rows 315 cols
[2023-03-08 18:12:29] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-08 18:12:29] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-08 18:12:29] [INFO ] Invariant cache hit.
[2023-03-08 18:12:29] [INFO ] Implicit Places using invariants and state equation in 359 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 616 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 314/325 places, 255/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 314 /314 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 641 ms. Remains : 314/325 places, 255/270 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s217 1), p1:(EQ s296 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-11 finished in 829 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((F(p1)&&p0))))'
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 317 transition count 262
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 317 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 317 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 314 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 314 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 314 transition count 254
Applied a total of 27 rules in 13 ms. Remains 314 /325 variables (removed 11) and now considering 254/270 (removed 16) transitions.
// Phase 1: matrix 254 rows 314 cols
[2023-03-08 18:12:30] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-08 18:12:30] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-08 18:12:30] [INFO ] Invariant cache hit.
[2023-03-08 18:12:30] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2023-03-08 18:12:30] [INFO ] Invariant cache hit.
[2023-03-08 18:12:30] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 314/325 places, 254/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 721 ms. Remains : 314/325 places, 254/270 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s26 1) (EQ s47 1) (EQ s68 1)), p1:(AND (EQ s5 1) (EQ s26 1) (EQ s47 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-13 finished in 860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 318 transition count 250
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 302 transition count 250
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 302 transition count 238
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 290 transition count 238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 284 transition count 232
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 72 place count 284 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 283 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 281 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 281 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 281 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 281 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 280 transition count 223
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 234 place count 204 transition count 147
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 5 with 4 rules applied. Total rules applied 238 place count 202 transition count 149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 200 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 199 transition count 147
Applied a total of 241 rules in 38 ms. Remains 199 /325 variables (removed 126) and now considering 147/270 (removed 123) transitions.
// Phase 1: matrix 147 rows 199 cols
[2023-03-08 18:12:30] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 18:12:31] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-08 18:12:31] [INFO ] Invariant cache hit.
[2023-03-08 18:12:31] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2023-03-08 18:12:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:12:31] [INFO ] Invariant cache hit.
[2023-03-08 18:12:31] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/325 places, 147/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 676 ms. Remains : 199/325 places, 147/270 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-15 finished in 715 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||G((F(p1) U 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' '!(F(p0))'
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(G(p1)))))'
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) U ((p1||F(p2)||G(p3)) U X(G(!p4)))))'
Found a Lengthening insensitive property : DES-PT-20b-LTLFireability-10
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) (NOT p3) p4), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p3))]
Support contains 12 out of 325 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 318 transition count 252
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 304 transition count 252
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 304 transition count 243
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 295 transition count 243
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 289 transition count 237
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 289 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 61 place count 289 transition count 235
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 288 transition count 234
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 286 transition count 232
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 286 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 69 place count 286 transition count 230
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 201 place count 220 transition count 164
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 207 place count 217 transition count 167
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 215 transition count 165
Applied a total of 209 rules in 29 ms. Remains 215 /325 variables (removed 110) and now considering 165/270 (removed 105) transitions.
// Phase 1: matrix 165 rows 215 cols
[2023-03-08 18:12:32] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 18:12:32] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-08 18:12:32] [INFO ] Invariant cache hit.
[2023-03-08 18:12:32] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-08 18:12:32] [INFO ] Invariant cache hit.
[2023-03-08 18:12:32] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 215/325 places, 165/270 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 606 ms. Remains : 215/325 places, 165/270 transitions.
Running random walk in product with property : DES-PT-20b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p4), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p4), acceptance={} source=1 dest: 1}, { cond=p4, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) p3 (NOT p0) (NOT p4)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p4), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) p4), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s84 1) (EQ s87 1) (EQ s93 1) (EQ s94 1) (EQ s99 1) (EQ s103 1)), p2:(AND (EQ s14 1) (EQ s125 1)), p0:(EQ s83 1), p4:(AND (EQ s97 1) (EQ s189 1...], 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]]
Stuttering criterion allowed to conclude after 2195 steps with 739 reset in 6 ms.
Treatment of property DES-PT-20b-LTLFireability-10 finished in 934 ms.
FORMULA DES-PT-20b-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 18:12:32] [INFO ] Flatten gal took : 22 ms
[2023-03-08 18:12:32] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 18:12:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 325 places, 270 transitions and 883 arcs took 3 ms.
Total runtime 49510 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1988/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1988/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1988/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1988/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-20b-LTLFireability-01
Could not compute solution for formula : DES-PT-20b-LTLFireability-04
Could not compute solution for formula : DES-PT-20b-LTLFireability-07
Could not compute solution for formula : DES-PT-20b-LTLFireability-10

BK_STOP 1678299154592

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x564bedacc3f4]
1: pnml2lts-mc(+0xa2496) [0x564bedacc496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f18788fa140]
3: pnml2lts-mc(+0x405be5) [0x564bede2fbe5]
4: pnml2lts-mc(+0x16b3f9) [0x564bedb953f9]
5: pnml2lts-mc(+0x164ac4) [0x564bedb8eac4]
6: pnml2lts-mc(+0x272e0a) [0x564bedc9ce0a]
7: pnml2lts-mc(+0xb61f0) [0x564bedae01f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f187874d4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f187874d67a]
10: pnml2lts-mc(+0xa1581) [0x564bedacb581]
11: pnml2lts-mc(+0xa1910) [0x564bedacb910]
12: pnml2lts-mc(+0xa32a2) [0x564bedacd2a2]
13: pnml2lts-mc(+0xa50f4) [0x564bedacf0f4]
14: pnml2lts-mc(+0xa516b) [0x564bedacf16b]
15: pnml2lts-mc(+0x3f34b3) [0x564bede1d4b3]
16: pnml2lts-mc(+0x7c63d) [0x564bedaa663d]
17: pnml2lts-mc(+0x67d86) [0x564beda91d86]
18: pnml2lts-mc(+0x60a8a) [0x564beda8aa8a]
19: pnml2lts-mc(+0x5eb15) [0x564beda88b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f1878735d0a]
21: pnml2lts-mc(+0x6075e) [0x564beda8a75e]
ltl formula name DES-PT-20b-LTLFireability-07
ltl formula formula --ltl=/tmp/1988/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 325 places, 270 transitions and 883 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1988/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1988/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1988/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1988/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x562d58f483f4]
1: pnml2lts-mc(+0xa2496) [0x562d58f48496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fd210860140]
3: pnml2lts-mc(+0x405be5) [0x562d592abbe5]
4: pnml2lts-mc(+0x16b3f9) [0x562d590113f9]
5: pnml2lts-mc(+0x164ac4) [0x562d5900aac4]
6: pnml2lts-mc(+0x272e0a) [0x562d59118e0a]
7: pnml2lts-mc(+0xb61f0) [0x562d58f5c1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fd2106b34d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fd2106b367a]
10: pnml2lts-mc(+0xa1581) [0x562d58f47581]
11: pnml2lts-mc(+0xa1910) [0x562d58f47910]
12: pnml2lts-mc(+0xa32a2) [0x562d58f492a2]
13: pnml2lts-mc(+0xa50f4) [0x562d58f4b0f4]
14: pnml2lts-mc(+0xa516b) [0x562d58f4b16b]
15: pnml2lts-mc(+0x3f34b3) [0x562d592994b3]
16: pnml2lts-mc(+0x7c63d) [0x562d58f2263d]
17: pnml2lts-mc(+0x67d86) [0x562d58f0dd86]
18: pnml2lts-mc(+0x60a8a) [0x562d58f06a8a]
19: pnml2lts-mc(+0x5eb15) [0x562d58f04b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fd21069bd0a]
21: pnml2lts-mc(+0x6075e) [0x562d58f0675e]
ltl formula name DES-PT-20b-LTLFireability-10
ltl formula formula --ltl=/tmp/1988/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 325 places, 270 transitions and 883 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1988/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1988/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1988/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1988/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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