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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 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.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 127K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678310747465

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-50b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 21:25:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 21:25:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:25:49] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-08 21:25:49] [INFO ] Transformed 479 places.
[2023-03-08 21:25:49] [INFO ] Transformed 430 transitions.
[2023-03-08 21:25:49] [INFO ] Found NUPN structural information;
[2023-03-08 21:25:49] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-50b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 430
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 452 transition count 406
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 452 transition count 406
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 439 transition count 393
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 439 transition count 393
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 439 transition count 382
Applied a total of 88 rules in 104 ms. Remains 439 /479 variables (removed 40) and now considering 382/430 (removed 48) transitions.
// Phase 1: matrix 382 rows 439 cols
[2023-03-08 21:25:49] [INFO ] Computed 62 place invariants in 45 ms
[2023-03-08 21:25:49] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-08 21:25:49] [INFO ] Invariant cache hit.
[2023-03-08 21:25:50] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2023-03-08 21:25:50] [INFO ] Invariant cache hit.
[2023-03-08 21:25:50] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/479 places, 382/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1227 ms. Remains : 439/479 places, 382/430 transitions.
Support contains 44 out of 439 places after structural reductions.
[2023-03-08 21:25:50] [INFO ] Flatten gal took : 57 ms
[2023-03-08 21:25:50] [INFO ] Flatten gal took : 32 ms
[2023-03-08 21:25:51] [INFO ] Input system was already deterministic with 382 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-08 21:25:52] [INFO ] Invariant cache hit.
[2023-03-08 21:25:52] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 21:25:52] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 30 ms returned sat
[2023-03-08 21:25:52] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-08 21:25:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 21:25:52] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-08 21:25:53] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-08 21:25:53] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 4 ms to minimize.
[2023-03-08 21:25:53] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2023-03-08 21:25:53] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2023-03-08 21:25:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 326 ms
[2023-03-08 21:25:53] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2023-03-08 21:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-08 21:25:54] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2023-03-08 21:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-08 21:25:54] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2023-03-08 21:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-08 21:25:54] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-08 21:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-08 21:25:54] [INFO ] After 2146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 584 ms.
[2023-03-08 21:25:55] [INFO ] After 3020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 1679 ms.
Support contains 15 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 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
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 14 rules applied. Total rules applied 15 place count 432 transition count 364
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 420 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 420 transition count 351
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 407 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 405 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 405 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 405 transition count 347
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 61 place count 404 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 403 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 403 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 403 transition count 344
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 208 place count 331 transition count 272
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 214 place count 328 transition count 280
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 328 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 327 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 217 place count 326 transition count 278
Applied a total of 217 rules in 182 ms. Remains 326 /439 variables (removed 113) and now considering 278/382 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 326/439 places, 278/382 transitions.
Incomplete random walk after 10000 steps, including 374 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 633599 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 633599 steps, saw 97228 distinct states, run finished after 3002 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 278 rows 326 cols
[2023-03-08 21:26:01] [INFO ] Computed 61 place invariants in 10 ms
[2023-03-08 21:26:01] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-08 21:26:01] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 21:26:01] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-08 21:26:01] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-08 21:26:01] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 157 ms returned sat
[2023-03-08 21:26:02] [INFO ] After 1166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-08 21:26:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 21:26:03] [INFO ] After 665ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-08 21:26:04] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2023-03-08 21:26:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-08 21:26:04] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-08 21:26:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-08 21:26:04] [INFO ] After 1830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 796 ms.
[2023-03-08 21:26:05] [INFO ] After 4178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 586 ms.
Support contains 15 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 278/278 transitions.
Applied a total of 0 rules in 15 ms. Remains 326 /326 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 326/326 places, 278/278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 278/278 transitions.
Applied a total of 0 rules in 15 ms. Remains 326 /326 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-08 21:26:06] [INFO ] Invariant cache hit.
[2023-03-08 21:26:06] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 21:26:06] [INFO ] Invariant cache hit.
[2023-03-08 21:26:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 21:26:06] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2023-03-08 21:26:06] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-08 21:26:06] [INFO ] Invariant cache hit.
[2023-03-08 21:26:06] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 850 ms. Remains : 326/326 places, 278/278 transitions.
Graph (complete) has 1096 edges and 326 vertex of which 325 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 325 /326 variables (removed 1) and now considering 278/278 (removed 0) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 278 rows 325 cols
[2023-03-08 21:26:06] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 21:26:07] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:26:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 21:26:07] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-08 21:26:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-08 21:26:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 133 ms returned sat
[2023-03-08 21:26:07] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-08 21:26:08] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2023-03-08 21:26:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-08 21:26:08] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2023-03-08 21:26:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 21:26:08] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2023-03-08 21:26:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-08 21:26:08] [INFO ] After 1116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 294 ms.
[2023-03-08 21:26:08] [INFO ] After 1788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
FORMULA DES-PT-50b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 257 stabilizing places and 249 stable transitions
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.21 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 10 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 21 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 21:26:09] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-08 21:26:09] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-08 21:26:09] [INFO ] Invariant cache hit.
[2023-03-08 21:26:09] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2023-03-08 21:26:09] [INFO ] Invariant cache hit.
[2023-03-08 21:26:10] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 934 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s421 1) (EQ s431 1)), p1:(AND (EQ s317 1) (EQ s319 1) (EQ s321 1) (EQ s323 1) (EQ s325 1) (EQ s327 1) (EQ s329 1) (EQ s331 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 3 ms.
FORMULA DES-PT-50b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-01 finished in 1220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 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 431 transition count 365
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 419 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 418 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 27 place count 418 transition count 351
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 404 transition count 350
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 404 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 403 transition count 349
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 403 transition count 348
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 208 place count 328 transition count 273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 214 place count 325 transition count 288
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 222 place count 325 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 323 transition count 278
Applied a total of 224 rules in 129 ms. Remains 323 /439 variables (removed 116) and now considering 278/382 (removed 104) transitions.
// Phase 1: matrix 278 rows 323 cols
[2023-03-08 21:26:10] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 21:26:10] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 21:26:10] [INFO ] Invariant cache hit.
[2023-03-08 21:26:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:11] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2023-03-08 21:26:11] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-08 21:26:11] [INFO ] Invariant cache hit.
[2023-03-08 21:26:11] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/439 places, 278/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 939 ms. Remains : 323/439 places, 278/382 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s276 1) (OR (NEQ s206 1) (NEQ s232 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5605 reset in 346 ms.
Product exploration explored 100000 steps with 5541 reset in 307 ms.
Computed a total of 216 stabilizing places and 217 stable transitions
Computed a total of 216 stabilizing places and 217 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 278/278 transitions.
Applied a total of 0 rules in 23 ms. Remains 323 /323 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-08 21:26:12] [INFO ] Invariant cache hit.
[2023-03-08 21:26:12] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-08 21:26:12] [INFO ] Invariant cache hit.
[2023-03-08 21:26:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:13] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2023-03-08 21:26:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 21:26:13] [INFO ] Invariant cache hit.
[2023-03-08 21:26:13] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 921 ms. Remains : 323/323 places, 278/278 transitions.
Computed a total of 216 stabilizing places and 217 stable transitions
Computed a total of 216 stabilizing places and 217 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 47 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5584 reset in 240 ms.
Product exploration explored 100000 steps with 5642 reset in 288 ms.
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 278/278 transitions.
Applied a total of 0 rules in 10 ms. Remains 323 /323 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-08 21:26:14] [INFO ] Invariant cache hit.
[2023-03-08 21:26:14] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-08 21:26:14] [INFO ] Invariant cache hit.
[2023-03-08 21:26:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:15] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2023-03-08 21:26:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:26:15] [INFO ] Invariant cache hit.
[2023-03-08 21:26:15] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 842 ms. Remains : 323/323 places, 278/278 transitions.
Treatment of property DES-PT-50b-LTLFireability-03 finished in 5113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 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 431 transition count 363
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 417 transition count 363
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 417 transition count 351
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 403 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 403 transition count 347
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 61 place count 402 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 401 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 401 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 401 transition count 344
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 220 place count 323 transition count 266
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 224 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 319 transition count 266
Applied a total of 226 rules in 65 ms. Remains 319 /439 variables (removed 120) and now considering 266/382 (removed 116) transitions.
// Phase 1: matrix 266 rows 319 cols
[2023-03-08 21:26:15] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 21:26:15] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 21:26:15] [INFO ] Invariant cache hit.
[2023-03-08 21:26:16] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2023-03-08 21:26:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:26:16] [INFO ] Invariant cache hit.
[2023-03-08 21:26:16] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 319/439 places, 266/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 826 ms. Remains : 319/439 places, 266/382 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s211 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-04 finished in 876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 26 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 21:26:16] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-08 21:26:16] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-08 21:26:16] [INFO ] Invariant cache hit.
[2023-03-08 21:26:17] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2023-03-08 21:26:17] [INFO ] Invariant cache hit.
[2023-03-08 21:26:17] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1003 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s275 1) (EQ s48 1) (EQ s289 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-05 finished in 1137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 22 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
[2023-03-08 21:26:17] [INFO ] Invariant cache hit.
[2023-03-08 21:26:17] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-08 21:26:17] [INFO ] Invariant cache hit.
[2023-03-08 21:26:18] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2023-03-08 21:26:18] [INFO ] Invariant cache hit.
[2023-03-08 21:26:18] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 962 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s318 1) (EQ s344 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 6 ms.
FORMULA DES-PT-50b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-06 finished in 1051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 431 transition count 364
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 418 transition count 364
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 27 place count 418 transition count 350
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 55 place count 404 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 402 transition count 348
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 402 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 402 transition count 346
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 401 transition count 345
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 400 transition count 344
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 400 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 400 transition count 343
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 216 place count 325 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 222 place count 322 transition count 276
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 320 transition count 274
Applied a total of 224 rules in 61 ms. Remains 320 /439 variables (removed 119) and now considering 274/382 (removed 108) transitions.
// Phase 1: matrix 274 rows 320 cols
[2023-03-08 21:26:18] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 21:26:18] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-08 21:26:18] [INFO ] Invariant cache hit.
[2023-03-08 21:26:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:19] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2023-03-08 21:26:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:26:19] [INFO ] Invariant cache hit.
[2023-03-08 21:26:19] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/439 places, 274/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 913 ms. Remains : 320/439 places, 274/382 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s57 0) (EQ s315 0)), p1:(OR (EQ s66 0) (EQ s315 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5146 reset in 298 ms.
Product exploration explored 100000 steps with 5107 reset in 283 ms.
Computed a total of 217 stabilizing places and 218 stable transitions
Computed a total of 217 stabilizing places and 218 stable transitions
Detected a total of 217/320 stabilizing places and 218/274 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 343 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 499 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 843426 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 843426 steps, saw 118926 distinct states, run finished after 3002 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 21:26:23] [INFO ] Invariant cache hit.
[2023-03-08 21:26:23] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 21:26:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 21:26:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2023-03-08 21:26:24] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 21:26:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:24] [INFO ] After 106ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-08 21:26:24] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-08 21:26:24] [INFO ] After 764ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 212 ms.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 274/274 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 320 transition count 273
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 320 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 319 transition count 272
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 319 transition count 272
Applied a total of 4 rules in 26 ms. Remains 319 /320 variables (removed 1) and now considering 272/274 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 319/320 places, 272/274 transitions.
Incomplete random walk after 10000 steps, including 500 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 930491 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 930491 steps, saw 130235 distinct states, run finished after 3001 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 272 rows 319 cols
[2023-03-08 21:26:28] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 21:26:28] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 21:26:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 21:26:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 172 ms returned sat
[2023-03-08 21:26:28] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 21:26:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:29] [INFO ] After 70ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 21:26:29] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-08 21:26:29] [INFO ] After 980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 107 ms.
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 272/272 transitions.
Applied a total of 0 rules in 7 ms. Remains 319 /319 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 319/319 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 272/272 transitions.
Applied a total of 0 rules in 7 ms. Remains 319 /319 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2023-03-08 21:26:29] [INFO ] Invariant cache hit.
[2023-03-08 21:26:29] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 21:26:29] [INFO ] Invariant cache hit.
[2023-03-08 21:26:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:30] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2023-03-08 21:26:30] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 21:26:30] [INFO ] Invariant cache hit.
[2023-03-08 21:26:30] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 862 ms. Remains : 319/319 places, 272/272 transitions.
Graph (complete) has 1132 edges and 319 vertex of which 318 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 318 transition count 272
Applied a total of 2 rules in 26 ms. Remains 318 /319 variables (removed 1) and now considering 272/272 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 272 rows 318 cols
[2023-03-08 21:26:30] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 21:26:30] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 21:26:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 21:26:30] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 112 ms returned sat
[2023-03-08 21:26:31] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 21:26:31] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-08 21:26:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-08 21:26:31] [INFO ] After 667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-08 21:26:31] [INFO ] After 972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 12 factoid took 414 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLFireability-08 finished in 13222 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&&X((F(p1)||G(!p0))))))'
Support contains 2 out of 439 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 431 transition count 364
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 418 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 418 transition count 351
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 403 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 403 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 402 transition count 347
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 401 transition count 346
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 401 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 401 transition count 345
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 211 place count 327 transition count 271
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 215 place count 325 transition count 273
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 217 place count 323 transition count 271
Applied a total of 217 rules in 55 ms. Remains 323 /439 variables (removed 116) and now considering 271/382 (removed 111) transitions.
// Phase 1: matrix 271 rows 323 cols
[2023-03-08 21:26:31] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-08 21:26:31] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 21:26:31] [INFO ] Invariant cache hit.
[2023-03-08 21:26:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 21:26:32] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2023-03-08 21:26:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:26:32] [INFO ] Invariant cache hit.
[2023-03-08 21:26:32] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/439 places, 271/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 849 ms. Remains : 323/439 places, 271/382 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, p0]
Running random walk in product with property : DES-PT-50b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s113 1) (EQ s234 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4474 reset in 257 ms.
Product exploration explored 100000 steps with 4438 reset in 226 ms.
Computed a total of 218 stabilizing places and 215 stable transitions
Computed a total of 218 stabilizing places and 215 stable transitions
Detected a total of 218/323 stabilizing places and 215/271 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[true, p0]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1585841 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :{}
Probabilistic random walk after 1585841 steps, saw 208769 distinct states, run finished after 3004 ms. (steps per millisecond=527 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:26:36] [INFO ] Invariant cache hit.
[2023-03-08 21:26:36] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 21:26:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2023-03-08 21:26:36] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:26:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 21:26:36] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 97 ms returned sat
[2023-03-08 21:26:36] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 21:26:36] [INFO ] After 16ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:36] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 21:26:36] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 271/271 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 323 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 322 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 321 transition count 274
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 321 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 320 transition count 273
Applied a total of 8 rules in 19 ms. Remains 320 /323 variables (removed 3) and now considering 273/271 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 320/323 places, 273/271 transitions.
Incomplete random walk after 10000 steps, including 505 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1533584 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :{}
Probabilistic random walk after 1533584 steps, saw 207620 distinct states, run finished after 3003 ms. (steps per millisecond=510 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 320 cols
[2023-03-08 21:26:39] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-08 21:26:40] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:26:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-08 21:26:40] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:26:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 21:26:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 127 ms returned sat
[2023-03-08 21:26:40] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:40] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:40] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 21:26:40] [INFO ] After 579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 5 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 320/320 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 5 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2023-03-08 21:26:40] [INFO ] Invariant cache hit.
[2023-03-08 21:26:40] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-08 21:26:40] [INFO ] Invariant cache hit.
[2023-03-08 21:26:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:41] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2023-03-08 21:26:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:26:41] [INFO ] Invariant cache hit.
[2023-03-08 21:26:41] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 964 ms. Remains : 320/320 places, 273/273 transitions.
Graph (complete) has 1114 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 319 /320 variables (removed 1) and now considering 273/273 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 319 cols
[2023-03-08 21:26:41] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 21:26:41] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 21:26:41] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 21:26:41] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:26:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 21:26:41] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 39 ms returned sat
[2023-03-08 21:26:42] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:42] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 21:26:42] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, p0]
Stuttering acceptance computed with spot in 63 ms :[true, p0]
Support contains 2 out of 323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 271/271 transitions.
Applied a total of 0 rules in 12 ms. Remains 323 /323 variables (removed 0) and now considering 271/271 (removed 0) transitions.
// Phase 1: matrix 271 rows 323 cols
[2023-03-08 21:26:42] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 21:26:42] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-08 21:26:42] [INFO ] Invariant cache hit.
[2023-03-08 21:26:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 21:26:43] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2023-03-08 21:26:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:26:43] [INFO ] Invariant cache hit.
[2023-03-08 21:26:43] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 868 ms. Remains : 323/323 places, 271/271 transitions.
Computed a total of 218 stabilizing places and 215 stable transitions
Computed a total of 218 stabilizing places and 215 stable transitions
Detected a total of 218/323 stabilizing places and 215/271 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 354 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, p0]
Incomplete random walk after 10000 steps, including 445 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1542442 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :{}
Probabilistic random walk after 1542442 steps, saw 202695 distinct states, run finished after 3001 ms. (steps per millisecond=513 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:26:46] [INFO ] Invariant cache hit.
[2023-03-08 21:26:46] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 21:26:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 21:26:46] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:26:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 21:26:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 96 ms returned sat
[2023-03-08 21:26:47] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 21:26:47] [INFO ] After 22ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:47] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 21:26:47] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 271/271 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 323 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 322 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 321 transition count 274
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 321 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 320 transition count 273
Applied a total of 8 rules in 16 ms. Remains 320 /323 variables (removed 3) and now considering 273/271 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 320/323 places, 273/271 transitions.
Incomplete random walk after 10000 steps, including 488 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1546940 steps, run timeout after 3001 ms. (steps per millisecond=515 ) properties seen :{}
Probabilistic random walk after 1546940 steps, saw 209513 distinct states, run finished after 3001 ms. (steps per millisecond=515 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 320 cols
[2023-03-08 21:26:50] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 21:26:50] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 21:26:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 21:26:50] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:26:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 21:26:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 125 ms returned sat
[2023-03-08 21:26:50] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:50] [INFO ] After 26ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:50] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 21:26:51] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 320/320 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 5 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2023-03-08 21:26:51] [INFO ] Invariant cache hit.
[2023-03-08 21:26:51] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 21:26:51] [INFO ] Invariant cache hit.
[2023-03-08 21:26:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:51] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2023-03-08 21:26:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 21:26:51] [INFO ] Invariant cache hit.
[2023-03-08 21:26:51] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 808 ms. Remains : 320/320 places, 273/273 transitions.
Graph (complete) has 1114 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 319 /320 variables (removed 1) and now considering 273/273 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 319 cols
[2023-03-08 21:26:51] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 21:26:51] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:26:51] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 21:26:51] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 21:26:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:26:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 40 ms returned sat
[2023-03-08 21:26:52] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 21:26:52] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 21:26:52] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, p0]
Stuttering acceptance computed with spot in 57 ms :[true, p0]
Stuttering acceptance computed with spot in 42 ms :[true, p0]
Product exploration explored 100000 steps with 4407 reset in 204 ms.
Product exploration explored 100000 steps with 4442 reset in 223 ms.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 271/271 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 323 transition count 270
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 322 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 5 place count 321 transition count 275
Applied a total of 5 rules in 11 ms. Remains 321 /323 variables (removed 2) and now considering 275/271 (removed -4) transitions.
// Phase 1: matrix 275 rows 321 cols
[2023-03-08 21:26:53] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-08 21:26:53] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 21:26:53] [INFO ] Invariant cache hit.
[2023-03-08 21:26:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:53] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2023-03-08 21:26:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:26:53] [INFO ] Invariant cache hit.
[2023-03-08 21:26:53] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 275/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 824 ms. Remains : 321/323 places, 275/271 transitions.
Treatment of property DES-PT-50b-LTLFireability-09 finished in 22155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(F(p2))))'
Support contains 5 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 17 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 21:26:53] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 21:26:54] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-08 21:26:54] [INFO ] Invariant cache hit.
[2023-03-08 21:26:54] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2023-03-08 21:26:54] [INFO ] Invariant cache hit.
[2023-03-08 21:26:54] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 996 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-50b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s413 1) (EQ s418 1)), p0:(AND (EQ s242 1) (EQ s262 1)), p2:(EQ s241 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-10 finished in 1222 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 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 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 431 transition count 363
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 417 transition count 363
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 417 transition count 350
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 404 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 402 transition count 348
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 402 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 402 transition count 346
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 401 transition count 345
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 400 transition count 344
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 400 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 400 transition count 343
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 214 place count 326 transition count 269
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 220 place count 323 transition count 277
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 321 transition count 275
Applied a total of 222 rules in 47 ms. Remains 321 /439 variables (removed 118) and now considering 275/382 (removed 107) transitions.
// Phase 1: matrix 275 rows 321 cols
[2023-03-08 21:26:55] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 21:26:55] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 21:26:55] [INFO ] Invariant cache hit.
[2023-03-08 21:26:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:26:55] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-03-08 21:26:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:26:55] [INFO ] Invariant cache hit.
[2023-03-08 21:26:55] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/439 places, 275/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 831 ms. Remains : 321/439 places, 275/382 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s108 1) (EQ s232 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-50b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-11 finished in 877 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 U (G(F((p2&&X((p2 U (!p3||G(p2)))))))&&p1)))))'
Support contains 6 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 436 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 436 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 434 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 434 transition count 376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 434 transition count 374
Applied a total of 13 rules in 24 ms. Remains 434 /439 variables (removed 5) and now considering 374/382 (removed 8) transitions.
// Phase 1: matrix 374 rows 434 cols
[2023-03-08 21:26:56] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-08 21:26:56] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-08 21:26:56] [INFO ] Invariant cache hit.
[2023-03-08 21:26:56] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2023-03-08 21:26:56] [INFO ] Invariant cache hit.
[2023-03-08 21:26:56] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/439 places, 374/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 941 ms. Remains : 434/439 places, 374/382 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (AND (NOT p2) p3)]
Running random walk in product with property : DES-PT-50b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s98 1) (EQ s426 1)), p0:(EQ s251 1), p2:(NEQ s209 1), p3:(AND (EQ s174 1) (EQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-12 finished in 1269 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||X((!p1 U (p2||G(!p1))))))))'
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 22 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 21:26:57] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-08 21:26:57] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-08 21:26:57] [INFO ] Invariant cache hit.
[2023-03-08 21:26:58] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2023-03-08 21:26:58] [INFO ] Invariant cache hit.
[2023-03-08 21:26:58] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1011 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s36 1) (EQ s289 1) (OR (EQ s30 0) (EQ s289 0))), p2:(AND (NOT (AND (EQ s36 1) (EQ s289 1))) (NOT (AND (EQ s30 1) (EQ s289 1)))), p1:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 881 reset in 217 ms.
Product exploration explored 100000 steps with 885 reset in 234 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 860 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 730355 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 730355 steps, saw 122072 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-08 21:27:02] [INFO ] Invariant cache hit.
[2023-03-08 21:27:03] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 21:27:03] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 33 ms returned sat
[2023-03-08 21:27:03] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 21:27:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 21:27:03] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 35 ms returned sat
[2023-03-08 21:27:03] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 21:27:03] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-08 21:27:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-08 21:27:03] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-08 21:27:04] [INFO ] After 956ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 410 transition count 340
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 399 transition count 340
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 213 place count 322 transition count 263
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 2 with 4 rules applied. Total rules applied 217 place count 320 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 320 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 318 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 317 transition count 263
Applied a total of 222 rules in 35 ms. Remains 317 /433 variables (removed 116) and now considering 263/373 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 317/433 places, 263/373 transitions.
Incomplete random walk after 10000 steps, including 518 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1004118 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1004118 steps, saw 140864 distinct states, run finished after 3004 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 317 cols
[2023-03-08 21:27:07] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 21:27:07] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:27:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 21:27:07] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 21:27:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 21:27:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2023-03-08 21:27:08] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 21:27:08] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2023-03-08 21:27:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 21:27:08] [INFO ] After 690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-08 21:27:08] [INFO ] After 1034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 97 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 317/317 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-08 21:27:08] [INFO ] Invariant cache hit.
[2023-03-08 21:27:08] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 21:27:08] [INFO ] Invariant cache hit.
[2023-03-08 21:27:09] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-08 21:27:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:27:09] [INFO ] Invariant cache hit.
[2023-03-08 21:27:09] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 744 ms. Remains : 317/317 places, 263/263 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 317 transition count 263
Applied a total of 1 rules in 10 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 317 cols
[2023-03-08 21:27:09] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 21:27:09] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 21:27:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 21:27:09] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 21:27:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 21:27:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2023-03-08 21:27:10] [INFO ] After 357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 21:27:10] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-08 21:27:10] [INFO ] After 837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 612 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 84 ms :[(AND p1 (NOT p2))]
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 426 transition count 354
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 411 transition count 354
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 411 transition count 343
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 400 transition count 343
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 207 place count 323 transition count 266
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 2 with 4 rules applied. Total rules applied 211 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 318 transition count 266
Applied a total of 214 rules in 28 ms. Remains 318 /433 variables (removed 115) and now considering 266/373 (removed 107) transitions.
// Phase 1: matrix 266 rows 318 cols
[2023-03-08 21:27:11] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 21:27:11] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-08 21:27:11] [INFO ] Invariant cache hit.
[2023-03-08 21:27:11] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2023-03-08 21:27:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:27:11] [INFO ] Invariant cache hit.
[2023-03-08 21:27:12] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 318/433 places, 266/373 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 318/433 places, 266/373 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 971691 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 971691 steps, saw 135845 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 21:27:15] [INFO ] Invariant cache hit.
[2023-03-08 21:27:15] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 21:27:15] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 29 ms returned sat
[2023-03-08 21:27:15] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 21:27:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 21:27:15] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-08 21:27:16] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 21:27:16] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 21:27:16] [INFO ] After 646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 317 transition count 264
Applied a total of 4 rules in 19 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 317/318 places, 264/266 transitions.
Incomplete random walk after 10000 steps, including 518 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 108 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1143272 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :{}
Probabilistic random walk after 1143272 steps, saw 159024 distinct states, run finished after 3001 ms. (steps per millisecond=380 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 264 rows 317 cols
[2023-03-08 21:27:19] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 21:27:19] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 21:27:19] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 22 ms returned sat
[2023-03-08 21:27:19] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 21:27:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:27:19] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 41 ms returned sat
[2023-03-08 21:27:20] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 21:27:20] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-08 21:27:20] [INFO ] After 557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2023-03-08 21:27:20] [INFO ] Invariant cache hit.
[2023-03-08 21:27:20] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-08 21:27:20] [INFO ] Invariant cache hit.
[2023-03-08 21:27:20] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2023-03-08 21:27:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:27:20] [INFO ] Invariant cache hit.
[2023-03-08 21:27:21] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 934 ms. Remains : 317/317 places, 264/264 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 317 transition count 264
Applied a total of 1 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 264 rows 317 cols
[2023-03-08 21:27:21] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 21:27:21] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 21:27:21] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 21:27:21] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 21:27:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:27:21] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 40 ms returned sat
[2023-03-08 21:27:21] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 21:27:21] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-08 21:27:21] [INFO ] After 530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 244 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND p1 (NOT p2))]
Product exploration explored 100000 steps with 5461 reset in 195 ms.
Product exploration explored 100000 steps with 5466 reset in 347 ms.
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 318 cols
[2023-03-08 21:27:22] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 21:27:22] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-08 21:27:22] [INFO ] Invariant cache hit.
[2023-03-08 21:27:23] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2023-03-08 21:27:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:27:23] [INFO ] Invariant cache hit.
[2023-03-08 21:27:23] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 744 ms. Remains : 318/318 places, 266/266 transitions.
Treatment of property DES-PT-50b-LTLFireability-13 finished in 26153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 436 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 436 transition count 378
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 435 transition count 377
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 435 transition count 376
Applied a total of 10 rules in 15 ms. Remains 435 /439 variables (removed 4) and now considering 376/382 (removed 6) transitions.
// Phase 1: matrix 376 rows 435 cols
[2023-03-08 21:27:23] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-08 21:27:23] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-08 21:27:23] [INFO ] Invariant cache hit.
[2023-03-08 21:27:24] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
[2023-03-08 21:27:24] [INFO ] Invariant cache hit.
[2023-03-08 21:27:24] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 435/439 places, 376/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1138 ms. Remains : 435/439 places, 376/382 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s299 0), p1:(EQ s216 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-15 finished in 1385 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)))'
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&&X((F(p1)||G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((!p1 U (p2||G(!p1))))))))'
Found a Lengthening insensitive property : DES-PT-50b-LTLFireability-13
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 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 431 transition count 363
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 417 transition count 363
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 417 transition count 351
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 403 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 403 transition count 347
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 61 place count 402 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 401 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 401 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 401 transition count 344
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 216 place count 325 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 222 place count 322 transition count 276
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 320 transition count 274
Applied a total of 224 rules in 55 ms. Remains 320 /439 variables (removed 119) and now considering 274/382 (removed 108) transitions.
// Phase 1: matrix 274 rows 320 cols
[2023-03-08 21:27:25] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 21:27:25] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 21:27:25] [INFO ] Invariant cache hit.
[2023-03-08 21:27:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:27:25] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2023-03-08 21:27:26] [INFO ] Invariant cache hit.
[2023-03-08 21:27:26] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 320/439 places, 274/382 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 986 ms. Remains : 320/439 places, 274/382 transitions.
Running random walk in product with property : DES-PT-50b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s31 1) (EQ s233 1) (OR (EQ s25 0) (EQ s233 0))), p2:(AND (NOT (AND (EQ s31 1) (EQ s233 1))) (NOT (AND (EQ s25 1) (EQ s233 1)))), p1:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5472 reset in 257 ms.
Product exploration explored 100000 steps with 5439 reset in 288 ms.
Computed a total of 217 stabilizing places and 218 stable transitions
Computed a total of 217 stabilizing places and 218 stable transitions
Detected a total of 217/320 stabilizing places and 218/274 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 867 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 556 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 661377 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661377 steps, saw 93989 distinct states, run finished after 3002 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-08 21:27:30] [INFO ] Invariant cache hit.
[2023-03-08 21:27:31] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 21:27:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:27:31] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 21:27:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 21:27:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 85 ms returned sat
[2023-03-08 21:27:31] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 21:27:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:27:31] [INFO ] After 102ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-08 21:27:31] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-08 21:27:32] [INFO ] After 1034ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1299 steps, including 2 resets, run visited all 2 properties in 9 ms. (steps per millisecond=144 )
Parikh walk visited 4 properties in 24 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))]
Knowledge based reduction with 16 factoid took 734 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 26 ms :[(AND p1 (NOT p2))]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 274/274 transitions.
Applied a total of 0 rules in 8 ms. Remains 320 /320 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-08 21:27:32] [INFO ] Invariant cache hit.
[2023-03-08 21:27:33] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-08 21:27:33] [INFO ] Invariant cache hit.
[2023-03-08 21:27:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:27:33] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-08 21:27:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:27:33] [INFO ] Invariant cache hit.
[2023-03-08 21:27:33] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 930 ms. Remains : 320/320 places, 274/274 transitions.
Computed a total of 217 stabilizing places and 218 stable transitions
Computed a total of 217 stabilizing places and 218 stable transitions
Detected a total of 217/320 stabilizing places and 218/274 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 550 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1078821 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Probabilistic random walk after 1078821 steps, saw 150796 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 21:27:37] [INFO ] Invariant cache hit.
[2023-03-08 21:27:37] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 21:27:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 21:27:37] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 21:27:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 21:27:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 117 ms returned sat
[2023-03-08 21:27:37] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 21:27:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:27:37] [INFO ] After 51ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 21:27:38] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-08 21:27:38] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2294 steps, including 6 resets, run visited all 2 properties in 22 ms. (steps per millisecond=104 )
Parikh walk visited 2 properties in 21 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 256 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 44 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND p1 (NOT p2))]
Product exploration explored 100000 steps with 5490 reset in 202 ms.
Product exploration explored 100000 steps with 5421 reset in 238 ms.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 274/274 transitions.
Applied a total of 0 rules in 5 ms. Remains 320 /320 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-08 21:27:38] [INFO ] Invariant cache hit.
[2023-03-08 21:27:39] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-08 21:27:39] [INFO ] Invariant cache hit.
[2023-03-08 21:27:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 21:27:39] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2023-03-08 21:27:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:27:39] [INFO ] Invariant cache hit.
[2023-03-08 21:27:39] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 932 ms. Remains : 320/320 places, 274/274 transitions.
Treatment of property DES-PT-50b-LTLFireability-13 finished in 14836 ms.
[2023-03-08 21:27:39] [INFO ] Flatten gal took : 24 ms
[2023-03-08 21:27:39] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 21:27:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 439 places, 382 transitions and 1339 arcs took 4 ms.
Total runtime 110742 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1814/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1814/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1814/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-50b-LTLFireability-03
Could not compute solution for formula : DES-PT-50b-LTLFireability-09
Could not compute solution for formula : DES-PT-50b-LTLFireability-13

BK_STOP 1678310861596

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DES-PT-50b-LTLFireability-03
ltl formula formula --ltl=/tmp/1814/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 439 places, 382 transitions and 1339 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.050 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1814/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1814/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1814/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1814/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name DES-PT-50b-LTLFireability-09
ltl formula formula --ltl=/tmp/1814/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
pnml2lts-mc( 0/ 4): Petri net has 439 places, 382 transitions and 1339 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1814/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1814/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1814/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1814/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x56257fc023f4]
1: pnml2lts-mc(+0xa2496) [0x56257fc02496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f29cc7f8140]
3: pnml2lts-mc(+0x405be5) [0x56257ff65be5]
4: pnml2lts-mc(+0x16b3f9) [0x56257fccb3f9]
5: pnml2lts-mc(+0x164ac4) [0x56257fcc4ac4]
6: pnml2lts-mc(+0x272e0a) [0x56257fdd2e0a]
7: pnml2lts-mc(+0xb61f0) [0x56257fc161f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f29cc64b4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f29cc64b67a]
10: pnml2lts-mc(+0xa1581) [0x56257fc01581]
11: pnml2lts-mc(+0xa1910) [0x56257fc01910]
12: pnml2lts-mc(+0xa32a2) [0x56257fc032a2]
13: pnml2lts-mc(+0xa50f4) [0x56257fc050f4]
14: pnml2lts-mc(+0xa516b) [0x56257fc0516b]
15: pnml2lts-mc(+0x3f34b3) [0x56257ff534b3]
16: pnml2lts-mc(+0x7c63d) [0x56257fbdc63d]
17: pnml2lts-mc(+0x67d86) [0x56257fbc7d86]
18: pnml2lts-mc(+0x60a8a) [0x56257fbc0a8a]
19: pnml2lts-mc(+0x5eb15) [0x56257fbbeb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f29cc633d0a]
21: pnml2lts-mc(+0x6075e) [0x56257fbc075e]
ltl formula name DES-PT-50b-LTLFireability-13
ltl formula formula --ltl=/tmp/1814/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 439 places, 382 transitions and 1339 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1814/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1814/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1814/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1814/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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-50b"
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-50b, 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-167814481300484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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