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-167814481200420.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-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 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.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 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 79K 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-10b-LTLFireability-00
FORMULA_NAME DES-PT-10b-LTLFireability-01
FORMULA_NAME DES-PT-10b-LTLFireability-02
FORMULA_NAME DES-PT-10b-LTLFireability-03
FORMULA_NAME DES-PT-10b-LTLFireability-04
FORMULA_NAME DES-PT-10b-LTLFireability-05
FORMULA_NAME DES-PT-10b-LTLFireability-06
FORMULA_NAME DES-PT-10b-LTLFireability-07
FORMULA_NAME DES-PT-10b-LTLFireability-08
FORMULA_NAME DES-PT-10b-LTLFireability-09
FORMULA_NAME DES-PT-10b-LTLFireability-10
FORMULA_NAME DES-PT-10b-LTLFireability-11
FORMULA_NAME DES-PT-10b-LTLFireability-12
FORMULA_NAME DES-PT-10b-LTLFireability-13
FORMULA_NAME DES-PT-10b-LTLFireability-14
FORMULA_NAME DES-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678295290893

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-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 17:08:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 17:08:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 17:08:12] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-08 17:08:12] [INFO ] Transformed 320 places.
[2023-03-08 17:08:12] [INFO ] Transformed 271 transitions.
[2023-03-08 17:08:12] [INFO ] Found NUPN structural information;
[2023-03-08 17:08:12] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-10b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 293 transition count 247
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 293 transition count 247
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 282 transition count 236
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 282 transition count 236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 282 transition count 228
Applied a total of 81 rules in 60 ms. Remains 282 /320 variables (removed 38) and now considering 228/271 (removed 43) transitions.
// Phase 1: matrix 228 rows 282 cols
[2023-03-08 17:08:12] [INFO ] Computed 62 place invariants in 34 ms
[2023-03-08 17:08:13] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-08 17:08:13] [INFO ] Invariant cache hit.
[2023-03-08 17:08:13] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2023-03-08 17:08:13] [INFO ] Invariant cache hit.
[2023-03-08 17:08:13] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 282/320 places, 228/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 983 ms. Remains : 282/320 places, 228/271 transitions.
Support contains 44 out of 282 places after structural reductions.
[2023-03-08 17:08:13] [INFO ] Flatten gal took : 43 ms
[2023-03-08 17:08:13] [INFO ] Flatten gal took : 17 ms
[2023-03-08 17:08:13] [INFO ] Input system was already deterministic with 228 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 27) seen :20
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 17:08:14] [INFO ] Invariant cache hit.
[2023-03-08 17:08:14] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 17:08:14] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-08 17:08:14] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:2
[2023-03-08 17:08:15] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 5 ms to minimize.
[2023-03-08 17:08:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-08 17:08:15] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-03-08 17:08:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-08 17:08:15] [INFO ] After 400ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 17:08:15] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 17:08:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 17:08:15] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-08 17:08:15] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 17:08:15] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2023-03-08 17:08:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 17:08:15] [INFO ] After 328ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-08 17:08:15] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 110 ms.
Support contains 11 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 279 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 279 transition count 208
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 264 transition count 208
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 264 transition count 198
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 254 transition count 198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 249 transition count 193
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 249 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 68 place count 249 transition count 188
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 70 place count 248 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 70 place count 248 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 246 transition count 185
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 245 transition count 184
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 245 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 245 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 77 place count 245 transition count 182
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 79 place count 244 transition count 182
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 223 place count 172 transition count 110
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 5 with 2 rules applied. Total rules applied 225 place count 171 transition count 110
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 228 place count 171 transition count 107
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 231 place count 168 transition count 107
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 168 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 167 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 167 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 166 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 236 place count 165 transition count 105
Applied a total of 236 rules in 102 ms. Remains 165 /282 variables (removed 117) and now considering 105/228 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 165/282 places, 105/228 transitions.
Incomplete random walk after 10000 steps, including 377 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 105 rows 165 cols
[2023-03-08 17:08:16] [INFO ] Computed 63 place invariants in 14 ms
[2023-03-08 17:08:16] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 17:08:16] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-08 17:08:16] [INFO ] After 66ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-08 17:08:16] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2023-03-08 17:08:16] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2023-03-08 17:08:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2023-03-08 17:08:16] [INFO ] After 159ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:08:16] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:08:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 17:08:16] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 25 ms returned sat
[2023-03-08 17:08:16] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 17:08:16] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 17:08:16] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 105/105 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 0 with 1 rules applied. Total rules applied 1 place count 165 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 164 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 163 transition count 103
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 163 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 162 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 161 transition count 101
Applied a total of 7 rules in 24 ms. Remains 161 /165 variables (removed 4) and now considering 101/105 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 161/165 places, 101/105 transitions.
Incomplete random walk after 10000 steps, including 366 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 372548 steps, run visited all 2 properties in 1077 ms. (steps per millisecond=345 )
Probabilistic random walk after 372548 steps, saw 82327 distinct states, run finished after 1077 ms. (steps per millisecond=345 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DES-PT-10b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 97 stabilizing places and 89 stable transitions
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 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((X(p1)&&p0))&&X(X((!X(p2) U p3)))))'
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 276 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 274 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 274 transition count 216
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 274 transition count 214
Applied a total of 22 rules in 26 ms. Remains 274 /282 variables (removed 8) and now considering 214/228 (removed 14) transitions.
// Phase 1: matrix 214 rows 274 cols
[2023-03-08 17:08:18] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-08 17:08:18] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 17:08:18] [INFO ] Invariant cache hit.
[2023-03-08 17:08:18] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 423 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/282 places, 214/228 transitions.
Applied a total of 0 rules in 5 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 455 ms. Remains : 273/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p3) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p1), (NOT p3), (OR (NOT p3) p2), true]
Running random walk in product with property : DES-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s166 1) (EQ s196 1)), p1:(EQ s138 1), p3:(OR (EQ s138 1) (AND (EQ s243 1) (EQ s269 1))), p2:(AND (EQ s249 1) (EQ s258 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 200 steps with 0 reset in 9 ms.
FORMULA DES-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-00 finished in 956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G((p1&&F(G(p1))))))))'
Support contains 3 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 276 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 274 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 274 transition count 216
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 274 transition count 214
Applied a total of 22 rules in 18 ms. Remains 274 /282 variables (removed 8) and now considering 214/228 (removed 14) transitions.
[2023-03-08 17:08:19] [INFO ] Invariant cache hit.
[2023-03-08 17:08:19] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-08 17:08:19] [INFO ] Invariant cache hit.
[2023-03-08 17:08:19] [INFO ] Implicit Places using invariants and state equation in 276 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 398 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/282 places, 214/228 transitions.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 426 ms. Remains : 273/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s105 1) (EQ s107 1)), p1:(EQ s264 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-02 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 276 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 274 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 274 transition count 216
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 274 transition count 214
Applied a total of 22 rules in 22 ms. Remains 274 /282 variables (removed 8) and now considering 214/228 (removed 14) transitions.
[2023-03-08 17:08:19] [INFO ] Invariant cache hit.
[2023-03-08 17:08:19] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 17:08:19] [INFO ] Invariant cache hit.
[2023-03-08 17:08:20] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-08 17:08:20] [INFO ] Invariant cache hit.
[2023-03-08 17:08:20] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 214/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 274/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s5 1) (EQ s16 1) (EQ s27 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-03 finished in 706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((F(p1)&&F(!p2)) U X(X(X(p1))))))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 277 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 275 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 275 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 275 transition count 216
Applied a total of 19 rules in 10 ms. Remains 275 /282 variables (removed 7) and now considering 216/228 (removed 12) transitions.
// Phase 1: matrix 216 rows 275 cols
[2023-03-08 17:08:20] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-08 17:08:20] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-08 17:08:20] [INFO ] Invariant cache hit.
[2023-03-08 17:08:20] [INFO ] Implicit Places using invariants and state equation in 331 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 546 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 216/228 transitions.
Applied a total of 0 rules in 3 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 559 ms. Remains : 274/282 places, 216/228 transitions.
Stuttering acceptance computed with spot in 920 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p0) (NOT p1)), p2, (AND p2 (NOT p0))]
Running random walk in product with property : DES-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}, { cond=p2, acceptance={} source=1 dest: 6}], [{ cond=p2, acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 8}, { cond=(AND p0 p2), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 p2), acceptance={} source=4 dest: 10}], [{ cond=true, acceptance={} source=5 dest: 11}, { cond=p2, acceptance={} source=5 dest: 12}], [{ cond=p2, acceptance={} source=6 dest: 13}], [{ cond=p2, acceptance={} source=7 dest: 14}], [{ cond=(NOT p0), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 12}, { cond=p0, acceptance={} source=8 dest: 15}, { cond=(AND p0 p2), acceptance={} source=8 dest: 16}], [{ cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 13}, { cond=(AND p0 p2), acceptance={} source=9 dest: 17}], [{ cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 14}, { cond=(AND p0 p2), acceptance={} source=10 dest: 18}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={0} source=11 dest: 12}], [{ cond=(AND (NOT p1) p2), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 19}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=15 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={} source=15 dest: 15}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=15 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=16 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=16 dest: 17}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=17 dest: 14}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=17 dest: 18}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=18 dest: 19}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=18 dest: 20}], [{ cond=p2, acceptance={0} source=19 dest: 19}], [{ cond=(AND (NOT p0) p2), acceptance={} source=20 dest: 19}, { cond=(AND p0 p2), acceptance={} source=20 dest: 20}]], initial=0, aps=[p0:(EQ s100 1), p2:(AND (EQ s60 1) (EQ s111 1)), p1:(NEQ s124 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 242 ms.
Product exploration explored 100000 steps with 25000 reset in 198 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/274 stabilizing places and 89/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 528 ms. Reduced automaton from 21 states, 43 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Finished random walk after 723 steps, including 6 resets, run visited all 3 properties in 11 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 11 factoid took 510 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Stuttering acceptance computed with spot in 328 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Support contains 3 out of 274 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 274 cols
[2023-03-08 17:08:24] [INFO ] Computed 61 place invariants in 10 ms
[2023-03-08 17:08:24] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 17:08:24] [INFO ] Invariant cache hit.
[2023-03-08 17:08:24] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-08 17:08:24] [INFO ] Invariant cache hit.
[2023-03-08 17:08:24] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 274/274 places, 216/216 transitions.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/274 stabilizing places and 89/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Finished random walk after 5541 steps, including 47 resets, run visited all 3 properties in 30 ms. (steps per millisecond=184 )
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Stuttering acceptance computed with spot in 326 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Stuttering acceptance computed with spot in 335 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Product exploration explored 100000 steps with 25000 reset in 134 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 269 transition count 213
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 269 transition count 215
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 269 transition count 215
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 264 transition count 210
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 264 transition count 210
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 264 transition count 213
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 119 place count 255 transition count 204
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 128 place count 255 transition count 204
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 133 place count 255 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 253 transition count 218
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 253 transition count 218
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 137 rules in 70 ms. Remains 253 /274 variables (removed 21) and now considering 218/216 (removed -2) transitions.
[2023-03-08 17:08:27] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 218 rows 253 cols
[2023-03-08 17:08:27] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 17:08:27] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/274 places, 218/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 253/274 places, 218/216 transitions.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 274 cols
[2023-03-08 17:08:27] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 17:08:27] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 17:08:27] [INFO ] Invariant cache hit.
[2023-03-08 17:08:28] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-08 17:08:28] [INFO ] Invariant cache hit.
[2023-03-08 17:08:28] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 274/274 places, 216/216 transitions.
Treatment of property DES-PT-10b-LTLFireability-04 finished in 7872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 274 transition count 209
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 260 transition count 209
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 260 transition count 199
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 250 transition count 199
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 246 transition count 195
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 246 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 61 place count 246 transition count 191
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 245 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 63 place count 245 transition count 189
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 65 place count 244 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 243 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 243 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 243 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 68 place count 243 transition count 186
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 70 place count 242 transition count 186
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 218 place count 168 transition count 112
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 222 place count 166 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 164 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 163 transition count 112
Applied a total of 225 rules in 49 ms. Remains 163 /282 variables (removed 119) and now considering 112/228 (removed 116) transitions.
// Phase 1: matrix 112 rows 163 cols
[2023-03-08 17:08:28] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 17:08:28] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 17:08:28] [INFO ] Invariant cache hit.
[2023-03-08 17:08:28] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-08 17:08:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 17:08:28] [INFO ] Invariant cache hit.
[2023-03-08 17:08:28] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/282 places, 112/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 379 ms. Remains : 163/282 places, 112/228 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s63 0) (EQ s68 0)), p1:(EQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-05 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(p1)) U X(!p2)))'
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 277 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 275 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 275 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 275 transition count 216
Applied a total of 19 rules in 14 ms. Remains 275 /282 variables (removed 7) and now considering 216/228 (removed 12) transitions.
// Phase 1: matrix 216 rows 275 cols
[2023-03-08 17:08:28] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-08 17:08:28] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-08 17:08:28] [INFO ] Invariant cache hit.
[2023-03-08 17:08:29] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 348 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 216/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 367 ms. Remains : 274/282 places, 216/228 transitions.
Stuttering acceptance computed with spot in 359 ms :[p2, p2, (AND p1 (NOT p0) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=p2, acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 8}, { cond=(AND p0 p2), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p1 p2), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(AND (EQ s85 1) (EQ s230 1)), p0:(AND (EQ s76 1) (EQ s256 1)), p2:(AND (EQ s36 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (OR (AND p1 p2) (AND p0 p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 25 factoid took 294 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10b-LTLFireability-06 finished in 1465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U p1))'
Support contains 3 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 276 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 275 transition count 210
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 261 transition count 210
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 261 transition count 200
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 251 transition count 200
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 246 transition count 195
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 246 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 64 place count 246 transition count 190
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 66 place count 245 transition count 189
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 66 place count 245 transition count 187
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 243 transition count 187
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 242 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 242 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 242 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 242 transition count 184
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 75 place count 241 transition count 184
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 223 place count 167 transition count 110
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 227 place count 165 transition count 112
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 228 place count 165 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 163 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 162 transition count 110
Applied a total of 231 rules in 52 ms. Remains 162 /282 variables (removed 120) and now considering 110/228 (removed 118) transitions.
// Phase 1: matrix 110 rows 162 cols
[2023-03-08 17:08:30] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 17:08:30] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 17:08:30] [INFO ] Invariant cache hit.
[2023-03-08 17:08:30] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-08 17:08:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 17:08:30] [INFO ] Invariant cache hit.
[2023-03-08 17:08:30] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/282 places, 110/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 598 ms. Remains : 162/282 places, 110/228 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), p0, p0]
Running random walk in product with property : DES-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s58 1), p0:(AND (EQ s22 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 15662 steps with 794 reset in 43 ms.
FORMULA DES-PT-10b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-07 finished in 879 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 (!p1&&G(!p2))))'
Support contains 5 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 274 transition count 211
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 262 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 261 transition count 210
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 27 place count 261 transition count 201
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 45 place count 252 transition count 201
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 50 place count 247 transition count 196
Iterating global reduction 3 with 5 rules applied. Total rules applied 55 place count 247 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 60 place count 247 transition count 191
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 62 place count 246 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 62 place count 246 transition count 188
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 66 place count 244 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 243 transition count 187
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 243 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 243 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 69 place count 243 transition count 185
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 71 place count 242 transition count 185
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 219 place count 168 transition count 111
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 6 with 2 rules applied. Total rules applied 221 place count 167 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 165 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 224 place count 164 transition count 109
Applied a total of 224 rules in 40 ms. Remains 164 /282 variables (removed 118) and now considering 109/228 (removed 119) transitions.
// Phase 1: matrix 109 rows 164 cols
[2023-03-08 17:08:31] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 17:08:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 17:08:31] [INFO ] Invariant cache hit.
[2023-03-08 17:08:31] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-08 17:08:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 17:08:31] [INFO ] Invariant cache hit.
[2023-03-08 17:08:31] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/282 places, 109/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 164/282 places, 109/228 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR p1 p2), (NOT p0), p2]
Running random walk in product with property : DES-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s54 1) (EQ s133 1) (EQ s47 1)), p2:(EQ s158 1), p0:(NEQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3789 reset in 239 ms.
Product exploration explored 100000 steps with 3807 reset in 332 ms.
Computed a total of 57 stabilizing places and 52 stable transitions
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/164 stabilizing places and 52/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 459 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR p1 p2), (NOT p0), p2]
Finished random walk after 12 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p2), (F (OR p1 p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 454 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR p1 p2), (NOT p0), p2]
Stuttering acceptance computed with spot in 137 ms :[(OR p1 p2), (NOT p0), p2]
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 17:08:33] [INFO ] Invariant cache hit.
[2023-03-08 17:08:33] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 17:08:33] [INFO ] Invariant cache hit.
[2023-03-08 17:08:33] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-08 17:08:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 17:08:33] [INFO ] Invariant cache hit.
[2023-03-08 17:08:33] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 164/164 places, 109/109 transitions.
Computed a total of 57 stabilizing places and 52 stable transitions
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/164 stabilizing places and 52/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 460 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR p1 p2), (NOT p0), p2]
Finished random walk after 11 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p2), (F (OR p1 p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 475 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR p1 p2), (NOT p0), p2]
Stuttering acceptance computed with spot in 112 ms :[(OR p1 p2), (NOT p0), p2]
Stuttering acceptance computed with spot in 187 ms :[(OR p1 p2), (NOT p0), p2]
Product exploration explored 100000 steps with 3779 reset in 204 ms.
Product exploration explored 100000 steps with 3825 reset in 228 ms.
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 109/109 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 17:08:35] [INFO ] Invariant cache hit.
[2023-03-08 17:08:35] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 17:08:35] [INFO ] Invariant cache hit.
[2023-03-08 17:08:36] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-08 17:08:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 17:08:36] [INFO ] Invariant cache hit.
[2023-03-08 17:08:36] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 358 ms. Remains : 164/164 places, 109/109 transitions.
Treatment of property DES-PT-10b-LTLFireability-10 finished in 5137 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(((p1&&G(p2))||p0)))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 277 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 276 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 276 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 276 transition count 217
Applied a total of 17 rules in 7 ms. Remains 276 /282 variables (removed 6) and now considering 217/228 (removed 11) transitions.
// Phase 1: matrix 217 rows 276 cols
[2023-03-08 17:08:36] [INFO ] Computed 62 place invariants in 1 ms
[2023-03-08 17:08:36] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 17:08:36] [INFO ] Invariant cache hit.
[2023-03-08 17:08:36] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 354 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 217/228 transitions.
Applied a total of 0 rules in 3 ms. Remains 275 /275 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 365 ms. Remains : 275/282 places, 217/228 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DES-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(EQ s185 0), p0:(OR (EQ s193 0) (EQ s223 0)), p1:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 532 edges and 275 vertex of which 270 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), true, (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 p2)))
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10b-LTLFireability-12 finished in 1004 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 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 274 transition count 209
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 260 transition count 209
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 260 transition count 199
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 250 transition count 199
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 245 transition count 194
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 245 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 64 place count 245 transition count 189
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 66 place count 244 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 66 place count 244 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 242 transition count 186
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 241 transition count 185
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 241 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 241 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 241 transition count 183
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 75 place count 240 transition count 183
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 225 place count 165 transition count 108
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 229 place count 163 transition count 110
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 163 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 161 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 160 transition count 108
Applied a total of 234 rules in 36 ms. Remains 160 /282 variables (removed 122) and now considering 108/228 (removed 120) transitions.
// Phase 1: matrix 108 rows 160 cols
[2023-03-08 17:08:37] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 17:08:37] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 17:08:37] [INFO ] Invariant cache hit.
[2023-03-08 17:08:37] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-08 17:08:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 17:08:37] [INFO ] Invariant cache hit.
[2023-03-08 17:08:37] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/282 places, 108/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 363 ms. Remains : 160/282 places, 108/228 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s150 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 20 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-13 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((F(p1)&&F(!p2)) U X(X(X(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(G(p0)) U (!p1&&G(!p2))))'
[2023-03-08 17:08:37] [INFO ] Flatten gal took : 19 ms
[2023-03-08 17:08:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 17:08:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 282 places, 228 transitions and 719 arcs took 2 ms.
Total runtime 25535 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1557/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1557/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-10b-LTLFireability-04
Could not compute solution for formula : DES-PT-10b-LTLFireability-10

BK_STOP 1678295319201

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-10b-LTLFireability-04
ltl formula formula --ltl=/tmp/1557/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 282 places, 228 transitions and 719 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1557/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1557/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1557/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1557/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 23 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DES-PT-10b-LTLFireability-10
ltl formula formula --ltl=/tmp/1557/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
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 282 places, 228 transitions and 719 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1557/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1557/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1557/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1557/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10b"
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-10b, 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-167814481200420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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