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.r391-oct2-167903715500636.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldPPPt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715500636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 376K Mar 5 18:23 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 ShieldPPPt-PT-020B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679279281105

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:28:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:28:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:28:03] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-20 02:28:03] [INFO ] Transformed 1563 places.
[2023-03-20 02:28:03] [INFO ] Transformed 1423 transitions.
[2023-03-20 02:28:03] [INFO ] Found NUPN structural information;
[2023-03-20 02:28:03] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-020B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 212 place count 1351 transition count 1211
Iterating global reduction 0 with 212 rules applied. Total rules applied 424 place count 1351 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 425 place count 1350 transition count 1210
Iterating global reduction 0 with 1 rules applied. Total rules applied 426 place count 1350 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 427 place count 1349 transition count 1209
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 1349 transition count 1209
Applied a total of 428 rules in 549 ms. Remains 1349 /1563 variables (removed 214) and now considering 1209/1423 (removed 214) transitions.
// Phase 1: matrix 1209 rows 1349 cols
[2023-03-20 02:28:04] [INFO ] Computed 221 place invariants in 31 ms
[2023-03-20 02:28:05] [INFO ] Implicit Places using invariants in 716 ms returned []
[2023-03-20 02:28:05] [INFO ] Invariant cache hit.
[2023-03-20 02:28:06] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
[2023-03-20 02:28:06] [INFO ] Invariant cache hit.
[2023-03-20 02:28:07] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1349/1563 places, 1209/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3779 ms. Remains : 1349/1563 places, 1209/1423 transitions.
Support contains 47 out of 1349 places after structural reductions.
[2023-03-20 02:28:08] [INFO ] Flatten gal took : 116 ms
[2023-03-20 02:28:08] [INFO ] Flatten gal took : 48 ms
[2023-03-20 02:28:08] [INFO ] Input system was already deterministic with 1209 transitions.
Support contains 45 out of 1349 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 32) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-20 02:28:09] [INFO ] Invariant cache hit.
[2023-03-20 02:28:10] [INFO ] [Real]Absence check using 221 positive place invariants in 95 ms returned sat
[2023-03-20 02:28:10] [INFO ] After 889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-20 02:28:11] [INFO ] [Nat]Absence check using 221 positive place invariants in 110 ms returned sat
[2023-03-20 02:28:13] [INFO ] After 1474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-20 02:28:13] [INFO ] Deduced a trap composed of 19 places in 461 ms of which 46 ms to minimize.
[2023-03-20 02:28:13] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 1 ms to minimize.
[2023-03-20 02:28:14] [INFO ] Deduced a trap composed of 20 places in 316 ms of which 2 ms to minimize.
[2023-03-20 02:28:14] [INFO ] Deduced a trap composed of 24 places in 370 ms of which 1 ms to minimize.
[2023-03-20 02:28:15] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:28:15] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 1 ms to minimize.
[2023-03-20 02:28:15] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2023-03-20 02:28:15] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 0 ms to minimize.
[2023-03-20 02:28:16] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2023-03-20 02:28:16] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 0 ms to minimize.
[2023-03-20 02:28:16] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 1 ms to minimize.
[2023-03-20 02:28:17] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 1 ms to minimize.
[2023-03-20 02:28:17] [INFO ] Deduced a trap composed of 30 places in 361 ms of which 1 ms to minimize.
[2023-03-20 02:28:17] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 1 ms to minimize.
[2023-03-20 02:28:18] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 0 ms to minimize.
[2023-03-20 02:28:18] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 0 ms to minimize.
[2023-03-20 02:28:19] [INFO ] Deduced a trap composed of 20 places in 467 ms of which 0 ms to minimize.
[2023-03-20 02:28:19] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 0 ms to minimize.
[2023-03-20 02:28:19] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 1 ms to minimize.
[2023-03-20 02:28:19] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 0 ms to minimize.
[2023-03-20 02:28:20] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
[2023-03-20 02:28:20] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 1 ms to minimize.
[2023-03-20 02:28:20] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 0 ms to minimize.
[2023-03-20 02:28:20] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2023-03-20 02:28:20] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 0 ms to minimize.
[2023-03-20 02:28:21] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 1 ms to minimize.
[2023-03-20 02:28:21] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 1 ms to minimize.
[2023-03-20 02:28:21] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 1 ms to minimize.
[2023-03-20 02:28:21] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 1 ms to minimize.
[2023-03-20 02:28:22] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 4 ms to minimize.
[2023-03-20 02:28:22] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 9336 ms
[2023-03-20 02:28:22] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 1 ms to minimize.
[2023-03-20 02:28:22] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2023-03-20 02:28:23] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 4 ms to minimize.
[2023-03-20 02:28:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 844 ms
[2023-03-20 02:28:23] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 5 ms to minimize.
[2023-03-20 02:28:23] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2023-03-20 02:28:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2023-03-20 02:28:24] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 1 ms to minimize.
[2023-03-20 02:28:24] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 1 ms to minimize.
[2023-03-20 02:28:24] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 1 ms to minimize.
[2023-03-20 02:28:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 772 ms
[2023-03-20 02:28:26] [INFO ] After 14477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1141 ms.
[2023-03-20 02:28:27] [INFO ] After 16853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 833 ms.
Support contains 17 out of 1349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 269 place count 1349 transition count 940
Reduce places removed 269 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 273 rules applied. Total rules applied 542 place count 1080 transition count 936
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 546 place count 1076 transition count 936
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 546 place count 1076 transition count 781
Deduced a syphon composed of 155 places in 2 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 856 place count 921 transition count 781
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 861 place count 916 transition count 776
Iterating global reduction 3 with 5 rules applied. Total rules applied 866 place count 916 transition count 776
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 866 place count 916 transition count 773
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 872 place count 913 transition count 773
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 1 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 3 with 670 rules applied. Total rules applied 1542 place count 578 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1543 place count 578 transition count 437
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1545 place count 577 transition count 436
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1655 place count 522 transition count 436
Partial Free-agglomeration rule applied 55 times.
Drop transitions removed 55 transitions
Iterating global reduction 4 with 55 rules applied. Total rules applied 1710 place count 522 transition count 436
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1711 place count 521 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1712 place count 520 transition count 435
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1712 place count 520 transition count 433
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1716 place count 518 transition count 433
Applied a total of 1716 rules in 273 ms. Remains 518 /1349 variables (removed 831) and now considering 433/1209 (removed 776) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 518/1349 places, 433/1209 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 433 rows 518 cols
[2023-03-20 02:28:29] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-20 02:28:29] [INFO ] [Real]Absence check using 220 positive place invariants in 70 ms returned sat
[2023-03-20 02:28:29] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:28:29] [INFO ] [Nat]Absence check using 220 positive place invariants in 83 ms returned sat
[2023-03-20 02:28:30] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:28:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 02:28:30] [INFO ] After 270ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 02:28:30] [INFO ] After 741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-20 02:28:31] [INFO ] After 1751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 116 ms.
Support contains 9 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 433/433 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 518 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 517 transition count 432
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 517 transition count 429
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 514 transition count 429
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 513 transition count 428
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 513 transition count 428
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 513 transition count 427
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 12 place count 512 transition count 427
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 16 place count 510 transition count 425
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 508 transition count 425
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 508 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 506 transition count 423
Applied a total of 23 rules in 98 ms. Remains 506 /518 variables (removed 12) and now considering 423/433 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 506/518 places, 423/433 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 120527 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120527 steps, saw 89161 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 423 rows 506 cols
[2023-03-20 02:28:34] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-20 02:28:35] [INFO ] [Real]Absence check using 220 positive place invariants in 36 ms returned sat
[2023-03-20 02:28:35] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:28:35] [INFO ] [Nat]Absence check using 220 positive place invariants in 35 ms returned sat
[2023-03-20 02:28:35] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:28:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:35] [INFO ] After 206ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 02:28:36] [INFO ] After 642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 246 ms.
[2023-03-20 02:28:36] [INFO ] After 1578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 66 ms.
Support contains 9 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 423/423 transitions.
Applied a total of 0 rules in 17 ms. Remains 506 /506 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 506/506 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 423/423 transitions.
Applied a total of 0 rules in 12 ms. Remains 506 /506 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2023-03-20 02:28:36] [INFO ] Invariant cache hit.
[2023-03-20 02:28:37] [INFO ] Implicit Places using invariants in 458 ms returned [489, 493]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 460 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 504/506 places, 423/423 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 502 transition count 421
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 18 ms. Remains 502 /504 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-20 02:28:37] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-20 02:28:37] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-20 02:28:37] [INFO ] Invariant cache hit.
[2023-03-20 02:28:38] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 502/506 places, 421/423 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1514 ms. Remains : 502/506 places, 421/423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 135612 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135612 steps, saw 104389 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-20 02:28:41] [INFO ] Invariant cache hit.
[2023-03-20 02:28:42] [INFO ] [Real]Absence check using 218 positive place invariants in 75 ms returned sat
[2023-03-20 02:28:42] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:28:42] [INFO ] [Nat]Absence check using 218 positive place invariants in 49 ms returned sat
[2023-03-20 02:28:42] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:28:43] [INFO ] After 699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-20 02:28:43] [INFO ] After 1222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 131 ms.
Support contains 9 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 18 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 502/502 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 26 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2023-03-20 02:28:43] [INFO ] Invariant cache hit.
[2023-03-20 02:28:44] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-03-20 02:28:44] [INFO ] Invariant cache hit.
[2023-03-20 02:28:44] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2023-03-20 02:28:44] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 02:28:44] [INFO ] Invariant cache hit.
[2023-03-20 02:28:45] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1735 ms. Remains : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 113 times.
Drop transitions removed 113 transitions
Iterating global reduction 0 with 113 rules applied. Total rules applied 113 place count 502 transition count 421
Applied a total of 113 rules in 18 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-20 02:28:45] [INFO ] Computed 218 place invariants in 4 ms
[2023-03-20 02:28:45] [INFO ] [Real]Absence check using 218 positive place invariants in 39 ms returned sat
[2023-03-20 02:28:45] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:28:45] [INFO ] [Nat]Absence check using 218 positive place invariants in 41 ms returned sat
[2023-03-20 02:28:46] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:28:46] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-20 02:28:46] [INFO ] After 268ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 02:28:46] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-20 02:28:46] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2023-03-20 02:28:47] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2023-03-20 02:28:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 572 ms
[2023-03-20 02:28:47] [INFO ] After 1274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-20 02:28:47] [INFO ] After 2296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 321 stabilizing places and 321 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p0||G(p1)))))))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 121 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-20 02:28:48] [INFO ] Computed 221 place invariants in 5 ms
[2023-03-20 02:28:49] [INFO ] Implicit Places using invariants in 764 ms returned []
[2023-03-20 02:28:49] [INFO ] Invariant cache hit.
[2023-03-20 02:28:50] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
[2023-03-20 02:28:50] [INFO ] Invariant cache hit.
[2023-03-20 02:28:51] [INFO ] Dead Transitions using invariants and state equation in 1010 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3040 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 344 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s1246 1), p1:(OR (NEQ s322 1) (NEQ s371 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 73214 steps with 0 reset in 423 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-00 finished in 3953 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)||G(p1)))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1348 transition count 930
Reduce places removed 278 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 557 place count 1070 transition count 929
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 1069 transition count 929
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 558 place count 1069 transition count 775
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 866 place count 915 transition count 775
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 872 place count 909 transition count 769
Iterating global reduction 3 with 6 rules applied. Total rules applied 878 place count 909 transition count 769
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 878 place count 909 transition count 765
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 886 place count 905 transition count 765
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1560 place count 568 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1561 place count 568 transition count 427
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1563 place count 567 transition count 426
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1677 place count 510 transition count 426
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1679 place count 508 transition count 424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1680 place count 507 transition count 424
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1680 place count 507 transition count 422
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 1684 place count 505 transition count 422
Applied a total of 1684 rules in 222 ms. Remains 505 /1349 variables (removed 844) and now considering 422/1209 (removed 787) transitions.
// Phase 1: matrix 422 rows 505 cols
[2023-03-20 02:28:52] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-20 02:28:52] [INFO ] Implicit Places using invariants in 290 ms returned [488, 492]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 292 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1349 places, 422/1209 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 420
Applied a total of 4 rules in 23 ms. Remains 501 /503 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 501 cols
[2023-03-20 02:28:52] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:28:53] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-20 02:28:53] [INFO ] Invariant cache hit.
[2023-03-20 02:28:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:53] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 501/1349 places, 420/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1593 ms. Remains : 501/1349 places, 420/1209 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s380 1), p0:(OR (EQ s429 1) (EQ s103 0) (EQ s374 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-02 finished in 1745 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((F((p0||(X((p2 U p3))&&p1))) U p4))))'
Support contains 7 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 93 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-20 02:28:54] [INFO ] Computed 221 place invariants in 6 ms
[2023-03-20 02:28:54] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-20 02:28:54] [INFO ] Invariant cache hit.
[2023-03-20 02:28:55] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2023-03-20 02:28:55] [INFO ] Invariant cache hit.
[2023-03-20 02:28:56] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2628 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p4), (NOT p4), (NOT p4), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p4), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p4) (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p4:(AND (EQ s645 1) (EQ s682 1)), p0:(EQ s86 1), p1:(AND (EQ s1307 1) (EQ s1331 1)), p3:(EQ s884 1), p2:(EQ s483 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 509 ms.
Stack based approach found an accepted trace after 2199 steps with 0 reset with depth 2200 and stack size 2200 in 13 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-04 finished in 3497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 79 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-20 02:28:57] [INFO ] Computed 221 place invariants in 10 ms
[2023-03-20 02:29:01] [INFO ] Implicit Places using invariants in 4088 ms returned []
[2023-03-20 02:29:01] [INFO ] Invariant cache hit.
[2023-03-20 02:29:03] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 6081 ms to find 0 implicit places.
[2023-03-20 02:29:03] [INFO ] Invariant cache hit.
[2023-03-20 02:29:04] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6767 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s90 1) (EQ s1013 0)), p1:(OR (AND (EQ s42 1) (EQ s1275 1)) (EQ s1275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 537 ms.
Stack based approach found an accepted trace after 456 steps with 0 reset with depth 457 and stack size 457 in 4 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-05 finished in 7442 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 1 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1348 transition count 928
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 560 place count 1068 transition count 772
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 872 place count 912 transition count 772
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 878 place count 906 transition count 766
Iterating global reduction 2 with 6 rules applied. Total rules applied 884 place count 906 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 884 place count 906 transition count 761
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 894 place count 901 transition count 761
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1568 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1569 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1571 place count 563 transition count 422
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1689 place count 504 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1691 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1692 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1692 place count 501 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1696 place count 499 transition count 418
Applied a total of 1696 rules in 128 ms. Remains 499 /1349 variables (removed 850) and now considering 418/1209 (removed 791) transitions.
// Phase 1: matrix 418 rows 499 cols
[2023-03-20 02:29:05] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-20 02:29:05] [INFO ] Implicit Places using invariants in 366 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 369 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/1349 places, 418/1209 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 495 transition count 416
Applied a total of 4 rules in 12 ms. Remains 495 /497 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 495 cols
[2023-03-20 02:29:05] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:29:05] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-20 02:29:05] [INFO ] Invariant cache hit.
[2023-03-20 02:29:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 02:29:07] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 495/1349 places, 416/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2652 ms. Remains : 495/1349 places, 416/1209 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-07 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:(EQ s249 0)], 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 3 reset in 447 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-07 finished in 3175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&G(p2)))))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1348 transition count 931
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 1071 transition count 930
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 1070 transition count 930
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 157 Pre rules applied. Total rules applied 556 place count 1070 transition count 773
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 870 place count 913 transition count 773
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 877 place count 906 transition count 766
Iterating global reduction 3 with 7 rules applied. Total rules applied 884 place count 906 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 884 place count 906 transition count 761
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 894 place count 901 transition count 761
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 1 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 1562 place count 567 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1563 place count 567 transition count 426
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1565 place count 566 transition count 425
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1681 place count 508 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1683 place count 506 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1684 place count 505 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1684 place count 505 transition count 421
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 1688 place count 503 transition count 421
Applied a total of 1688 rules in 175 ms. Remains 503 /1349 variables (removed 846) and now considering 421/1209 (removed 788) transitions.
// Phase 1: matrix 421 rows 503 cols
[2023-03-20 02:29:08] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-20 02:29:08] [INFO ] Implicit Places using invariants in 308 ms returned [486, 490]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 309 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1349 places, 421/1209 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 499 transition count 419
Applied a total of 4 rules in 13 ms. Remains 499 /501 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 499 cols
[2023-03-20 02:29:08] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:29:08] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-20 02:29:08] [INFO ] Invariant cache hit.
[2023-03-20 02:29:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:29:09] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 499/1349 places, 419/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1306 ms. Remains : 499/1349 places, 419/1209 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s299 0), p1:(OR (EQ s384 0) (EQ s402 0)), p2:(EQ s26 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 486 ms.
Stack based approach found an accepted trace after 53749 steps with 0 reset with depth 53750 and stack size 46668 in 304 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-08 finished in 2302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 79 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-20 02:29:10] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-20 02:29:11] [INFO ] Implicit Places using invariants in 653 ms returned []
[2023-03-20 02:29:11] [INFO ] Invariant cache hit.
[2023-03-20 02:29:12] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2436 ms to find 0 implicit places.
[2023-03-20 02:29:12] [INFO ] Invariant cache hit.
[2023-03-20 02:29:13] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3331 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1143 1) (NEQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 426 ms.
Product exploration explored 100000 steps with 0 reset in 594 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 239513 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239513 steps, saw 146539 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:29:18] [INFO ] Invariant cache hit.
[2023-03-20 02:29:18] [INFO ] [Real]Absence check using 221 positive place invariants in 67 ms returned sat
[2023-03-20 02:29:19] [INFO ] After 702ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 02:29:20] [INFO ] Deduced a trap composed of 35 places in 608 ms of which 1 ms to minimize.
[2023-03-20 02:29:20] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 3 ms to minimize.
[2023-03-20 02:29:20] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 2 ms to minimize.
[2023-03-20 02:29:20] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 1 ms to minimize.
[2023-03-20 02:29:21] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 1 ms to minimize.
[2023-03-20 02:29:21] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 0 ms to minimize.
[2023-03-20 02:29:21] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 1 ms to minimize.
[2023-03-20 02:29:22] [INFO ] Deduced a trap composed of 27 places in 440 ms of which 1 ms to minimize.
[2023-03-20 02:29:22] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2023-03-20 02:29:22] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 1 ms to minimize.
[2023-03-20 02:29:22] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 0 ms to minimize.
[2023-03-20 02:29:23] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2023-03-20 02:29:23] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 0 ms to minimize.
[2023-03-20 02:29:23] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2023-03-20 02:29:23] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 0 ms to minimize.
[2023-03-20 02:29:24] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 1 ms to minimize.
[2023-03-20 02:29:24] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2023-03-20 02:29:24] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 20 ms to minimize.
[2023-03-20 02:29:24] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2023-03-20 02:29:24] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 1 ms to minimize.
[2023-03-20 02:29:25] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 0 ms to minimize.
[2023-03-20 02:29:25] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 1 ms to minimize.
[2023-03-20 02:29:25] [INFO ] Deduced a trap composed of 38 places in 405 ms of which 7 ms to minimize.
[2023-03-20 02:29:25] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-03-20 02:29:26] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2023-03-20 02:29:26] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6812 ms
[2023-03-20 02:29:26] [INFO ] After 7571ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:29:26] [INFO ] After 7907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:29:26] [INFO ] [Nat]Absence check using 221 positive place invariants in 50 ms returned sat
[2023-03-20 02:29:26] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:27] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 1 ms to minimize.
[2023-03-20 02:29:27] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2023-03-20 02:29:27] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 0 ms to minimize.
[2023-03-20 02:29:28] [INFO ] Deduced a trap composed of 25 places in 386 ms of which 1 ms to minimize.
[2023-03-20 02:29:28] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2023-03-20 02:29:28] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 1 ms to minimize.
[2023-03-20 02:29:28] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 1 ms to minimize.
[2023-03-20 02:29:29] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 1 ms to minimize.
[2023-03-20 02:29:29] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 1 ms to minimize.
[2023-03-20 02:29:29] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 1 ms to minimize.
[2023-03-20 02:29:30] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 0 ms to minimize.
[2023-03-20 02:29:30] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 1 ms to minimize.
[2023-03-20 02:29:30] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 0 ms to minimize.
[2023-03-20 02:29:30] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 1 ms to minimize.
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 0 ms to minimize.
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 0 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 0 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 1 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 1 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 0 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 0 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6914 ms
[2023-03-20 02:29:33] [INFO ] After 7512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-20 02:29:34] [INFO ] After 7822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 556 place count 1063 transition count 764
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 874 place count 904 transition count 764
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 1 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1554 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1555 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1557 place count 563 transition count 422
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1673 place count 505 transition count 422
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 1732 place count 505 transition count 422
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1733 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1734 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1734 place count 503 transition count 419
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1738 place count 501 transition count 419
Applied a total of 1738 rules in 124 ms. Remains 501 /1341 variables (removed 840) and now considering 419/1201 (removed 782) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 501/1341 places, 419/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Finished Best-First random walk after 440 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=220 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 74 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-20 02:29:34] [INFO ] Invariant cache hit.
[2023-03-20 02:29:35] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-20 02:29:35] [INFO ] Invariant cache hit.
[2023-03-20 02:29:36] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
[2023-03-20 02:29:36] [INFO ] Invariant cache hit.
[2023-03-20 02:29:37] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2654 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 262769 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262769 steps, saw 159862 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:29:40] [INFO ] Invariant cache hit.
[2023-03-20 02:29:41] [INFO ] [Real]Absence check using 221 positive place invariants in 54 ms returned sat
[2023-03-20 02:29:41] [INFO ] After 647ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 02:29:42] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 0 ms to minimize.
[2023-03-20 02:29:42] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 0 ms to minimize.
[2023-03-20 02:29:42] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 0 ms to minimize.
[2023-03-20 02:29:42] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 0 ms to minimize.
[2023-03-20 02:29:43] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 1 ms to minimize.
[2023-03-20 02:29:43] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 1 ms to minimize.
[2023-03-20 02:29:43] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2023-03-20 02:29:43] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 1 ms to minimize.
[2023-03-20 02:29:44] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2023-03-20 02:29:44] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 0 ms to minimize.
[2023-03-20 02:29:44] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 1 ms to minimize.
[2023-03-20 02:29:45] [INFO ] Deduced a trap composed of 22 places in 458 ms of which 1 ms to minimize.
[2023-03-20 02:29:45] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 0 ms to minimize.
[2023-03-20 02:29:45] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 0 ms to minimize.
[2023-03-20 02:29:45] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 1 ms to minimize.
[2023-03-20 02:29:46] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:29:46] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2023-03-20 02:29:46] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 1 ms to minimize.
[2023-03-20 02:29:46] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 0 ms to minimize.
[2023-03-20 02:29:47] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 4 ms to minimize.
[2023-03-20 02:29:47] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2023-03-20 02:29:47] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 14 ms to minimize.
[2023-03-20 02:29:47] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2023-03-20 02:29:47] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2023-03-20 02:29:48] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-20 02:29:48] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6408 ms
[2023-03-20 02:29:48] [INFO ] After 7110ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:29:48] [INFO ] After 7422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:29:48] [INFO ] [Nat]Absence check using 221 positive place invariants in 72 ms returned sat
[2023-03-20 02:29:49] [INFO ] After 602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:49] [INFO ] Deduced a trap composed of 35 places in 321 ms of which 0 ms to minimize.
[2023-03-20 02:29:49] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 1 ms to minimize.
[2023-03-20 02:29:50] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 0 ms to minimize.
[2023-03-20 02:29:50] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 0 ms to minimize.
[2023-03-20 02:29:50] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 0 ms to minimize.
[2023-03-20 02:29:50] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 1 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 33 places in 225 ms of which 1 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 0 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 0 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 0 ms to minimize.
[2023-03-20 02:29:52] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 0 ms to minimize.
[2023-03-20 02:29:52] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2023-03-20 02:29:52] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 1 ms to minimize.
[2023-03-20 02:29:52] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 0 ms to minimize.
[2023-03-20 02:29:53] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 1 ms to minimize.
[2023-03-20 02:29:53] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 8 ms to minimize.
[2023-03-20 02:29:53] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 0 ms to minimize.
[2023-03-20 02:29:53] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 0 ms to minimize.
[2023-03-20 02:29:53] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 0 ms to minimize.
[2023-03-20 02:29:54] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
[2023-03-20 02:29:54] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 0 ms to minimize.
[2023-03-20 02:29:54] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2023-03-20 02:29:54] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2023-03-20 02:29:54] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 0 ms to minimize.
[2023-03-20 02:29:55] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2023-03-20 02:29:55] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2023-03-20 02:29:55] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 0 ms to minimize.
[2023-03-20 02:29:55] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 0 ms to minimize.
[2023-03-20 02:29:55] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 0 ms to minimize.
[2023-03-20 02:29:55] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6588 ms
[2023-03-20 02:29:55] [INFO ] After 7220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-20 02:29:55] [INFO ] After 7585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 556 place count 1063 transition count 764
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 874 place count 904 transition count 764
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1554 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1555 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1557 place count 563 transition count 422
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1673 place count 505 transition count 422
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 1732 place count 505 transition count 422
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1733 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1734 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1734 place count 503 transition count 419
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1738 place count 501 transition count 419
Applied a total of 1738 rules in 120 ms. Remains 501 /1341 variables (removed 840) and now considering 419/1201 (removed 782) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 501/1341 places, 419/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Finished Best-First random walk after 699 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=233 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 483 ms.
Product exploration explored 100000 steps with 0 reset in 632 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 1201
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 278 place count 1341 transition count 1281
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 378 place count 1341 transition count 1281
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 757 places in 2 ms
Iterating global reduction 1 with 379 rules applied. Total rules applied 757 place count 1341 transition count 1282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 758 place count 1341 transition count 1281
Renaming transitions due to excessive name length > 1024 char.
Discarding 140 places :
Symmetric choice reduction at 2 with 140 rule applications. Total rules 898 place count 1201 transition count 1141
Deduced a syphon composed of 617 places in 1 ms
Iterating global reduction 2 with 140 rules applied. Total rules applied 1038 place count 1201 transition count 1141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 618 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1039 place count 1201 transition count 1141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1041 place count 1199 transition count 1139
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1043 place count 1199 transition count 1139
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -330
Deduced a syphon composed of 694 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1121 place count 1199 transition count 1469
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1199 place count 1121 transition count 1313
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1277 place count 1121 transition count 1313
Deduced a syphon composed of 616 places in 1 ms
Applied a total of 1277 rules in 583 ms. Remains 1121 /1341 variables (removed 220) and now considering 1313/1201 (removed -112) transitions.
[2023-03-20 02:29:58] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 1313 rows 1121 cols
[2023-03-20 02:29:58] [INFO ] Computed 221 place invariants in 7 ms
[2023-03-20 02:30:00] [INFO ] Dead Transitions using invariants and state equation in 2087 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1121/1341 places, 1313/1201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2787 ms. Remains : 1121/1341 places, 1313/1201 transitions.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 38 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-20 02:30:00] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-20 02:30:01] [INFO ] Implicit Places using invariants in 551 ms returned []
[2023-03-20 02:30:01] [INFO ] Invariant cache hit.
[2023-03-20 02:30:02] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
[2023-03-20 02:30:02] [INFO ] Invariant cache hit.
[2023-03-20 02:30:03] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2475 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-09 finished in 52923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0&&F(p1))) U G(p2)))))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 86 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
[2023-03-20 02:30:03] [INFO ] Invariant cache hit.
[2023-03-20 02:30:03] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-20 02:30:03] [INFO ] Invariant cache hit.
[2023-03-20 02:30:06] [INFO ] Implicit Places using invariants and state equation in 2581 ms returned []
Implicit Place search using SMT with State Equation took 3078 ms to find 0 implicit places.
[2023-03-20 02:30:06] [INFO ] Invariant cache hit.
[2023-03-20 02:30:07] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4004 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 446 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s50 1), p0:(EQ s80 1), p1:(EQ s432 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 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-10 finished in 4488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&X(X(F(p1)))))))'
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1341 transition count 1201
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1341 transition count 1201
Applied a total of 16 rules in 131 ms. Remains 1341 /1349 variables (removed 8) and now considering 1201/1209 (removed 8) transitions.
[2023-03-20 02:30:08] [INFO ] Invariant cache hit.
[2023-03-20 02:30:08] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-20 02:30:08] [INFO ] Invariant cache hit.
[2023-03-20 02:30:09] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 1843 ms to find 0 implicit places.
[2023-03-20 02:30:09] [INFO ] Invariant cache hit.
[2023-03-20 02:30:10] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1349 places, 1201/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2784 ms. Remains : 1341/1349 places, 1201/1209 transitions.
Stuttering acceptance computed with spot in 307 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s1027 1) (EQ s1052 1)), p1:(AND (EQ s586 1) (EQ s635 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 495 ms.
Product exploration explored 100000 steps with 44 reset in 534 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:30:12] [INFO ] Invariant cache hit.
[2023-03-20 02:30:12] [INFO ] [Real]Absence check using 221 positive place invariants in 62 ms returned sat
[2023-03-20 02:30:13] [INFO ] After 703ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 02:30:14] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 1 ms to minimize.
[2023-03-20 02:30:14] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 0 ms to minimize.
[2023-03-20 02:30:14] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 0 ms to minimize.
[2023-03-20 02:30:14] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 1 ms to minimize.
[2023-03-20 02:30:15] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 1 ms to minimize.
[2023-03-20 02:30:15] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 0 ms to minimize.
[2023-03-20 02:30:16] [INFO ] Deduced a trap composed of 29 places in 496 ms of which 0 ms to minimize.
[2023-03-20 02:30:16] [INFO ] Deduced a trap composed of 20 places in 310 ms of which 1 ms to minimize.
[2023-03-20 02:30:16] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 0 ms to minimize.
[2023-03-20 02:30:16] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 1 ms to minimize.
[2023-03-20 02:30:17] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 1 ms to minimize.
[2023-03-20 02:30:17] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 0 ms to minimize.
[2023-03-20 02:30:17] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2023-03-20 02:30:17] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 1 ms to minimize.
[2023-03-20 02:30:18] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 1 ms to minimize.
[2023-03-20 02:30:18] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 0 ms to minimize.
[2023-03-20 02:30:18] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 1 ms to minimize.
[2023-03-20 02:30:18] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 1 ms to minimize.
[2023-03-20 02:30:19] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2023-03-20 02:30:19] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2023-03-20 02:30:19] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 1 ms to minimize.
[2023-03-20 02:30:20] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 1 ms to minimize.
[2023-03-20 02:30:20] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 1 ms to minimize.
[2023-03-20 02:30:20] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 0 ms to minimize.
[2023-03-20 02:30:20] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7023 ms
[2023-03-20 02:30:20] [INFO ] After 7803ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:30:20] [INFO ] After 8109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:30:21] [INFO ] [Nat]Absence check using 221 positive place invariants in 58 ms returned sat
[2023-03-20 02:30:21] [INFO ] After 650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:30:22] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 1 ms to minimize.
[2023-03-20 02:30:22] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 1 ms to minimize.
[2023-03-20 02:30:22] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 1 ms to minimize.
[2023-03-20 02:30:23] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 1 ms to minimize.
[2023-03-20 02:30:23] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 0 ms to minimize.
[2023-03-20 02:30:23] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 1 ms to minimize.
[2023-03-20 02:30:23] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 1 ms to minimize.
[2023-03-20 02:30:24] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 0 ms to minimize.
[2023-03-20 02:30:24] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 0 ms to minimize.
[2023-03-20 02:30:24] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 0 ms to minimize.
[2023-03-20 02:30:24] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 1 ms to minimize.
[2023-03-20 02:30:25] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 0 ms to minimize.
[2023-03-20 02:30:25] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 1 ms to minimize.
[2023-03-20 02:30:25] [INFO ] Deduced a trap composed of 34 places in 310 ms of which 1 ms to minimize.
[2023-03-20 02:30:26] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 1 ms to minimize.
[2023-03-20 02:30:26] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 0 ms to minimize.
[2023-03-20 02:30:26] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 0 ms to minimize.
[2023-03-20 02:30:26] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2023-03-20 02:30:26] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 0 ms to minimize.
[2023-03-20 02:30:27] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2023-03-20 02:30:27] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 0 ms to minimize.
[2023-03-20 02:30:27] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2023-03-20 02:30:27] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 0 ms to minimize.
[2023-03-20 02:30:27] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2023-03-20 02:30:27] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2023-03-20 02:30:28] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 0 ms to minimize.
[2023-03-20 02:30:28] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2023-03-20 02:30:29] [INFO ] Deduced a trap composed of 34 places in 839 ms of which 1 ms to minimize.
[2023-03-20 02:30:29] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2023-03-20 02:30:29] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7770 ms
[2023-03-20 02:30:29] [INFO ] After 8513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-20 02:30:29] [INFO ] After 8902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 556 place count 1063 transition count 762
Deduced a syphon composed of 161 places in 2 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 878 place count 902 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1556 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 563 transition count 422
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1559 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1677 place count 503 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1735 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1736 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1737 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1737 place count 501 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1741 place count 499 transition count 418
Applied a total of 1741 rules in 123 ms. Remains 499 /1341 variables (removed 842) and now considering 418/1201 (removed 783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 499/1341 places, 418/1201 transitions.
Finished random walk after 4020 steps, including 1 resets, run visited all 1 properties in 19 ms. (steps per millisecond=211 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 69 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-20 02:30:30] [INFO ] Invariant cache hit.
[2023-03-20 02:30:31] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-20 02:30:31] [INFO ] Invariant cache hit.
[2023-03-20 02:30:34] [INFO ] Implicit Places using invariants and state equation in 3062 ms returned []
Implicit Place search using SMT with State Equation took 3623 ms to find 0 implicit places.
[2023-03-20 02:30:34] [INFO ] Invariant cache hit.
[2023-03-20 02:30:35] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4425 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:30:35] [INFO ] Invariant cache hit.
[2023-03-20 02:30:35] [INFO ] [Real]Absence check using 221 positive place invariants in 54 ms returned sat
[2023-03-20 02:30:36] [INFO ] After 612ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 02:30:36] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 0 ms to minimize.
[2023-03-20 02:30:37] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 0 ms to minimize.
[2023-03-20 02:30:37] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 0 ms to minimize.
[2023-03-20 02:30:37] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 1 ms to minimize.
[2023-03-20 02:30:37] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 1 ms to minimize.
[2023-03-20 02:30:38] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2023-03-20 02:30:38] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 0 ms to minimize.
[2023-03-20 02:30:38] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 0 ms to minimize.
[2023-03-20 02:30:38] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 0 ms to minimize.
[2023-03-20 02:30:39] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 1 ms to minimize.
[2023-03-20 02:30:39] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 1 ms to minimize.
[2023-03-20 02:30:39] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 1 ms to minimize.
[2023-03-20 02:30:39] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2023-03-20 02:30:40] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 0 ms to minimize.
[2023-03-20 02:30:40] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 0 ms to minimize.
[2023-03-20 02:30:40] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 2 ms to minimize.
[2023-03-20 02:30:40] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 0 ms to minimize.
[2023-03-20 02:30:40] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 0 ms to minimize.
[2023-03-20 02:30:41] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2023-03-20 02:30:41] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2023-03-20 02:30:41] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2023-03-20 02:30:41] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 3 ms to minimize.
[2023-03-20 02:30:42] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 1 ms to minimize.
[2023-03-20 02:30:42] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 0 ms to minimize.
[2023-03-20 02:30:42] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5800 ms
[2023-03-20 02:30:42] [INFO ] After 6492ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:30:42] [INFO ] After 6744ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:30:42] [INFO ] [Nat]Absence check using 221 positive place invariants in 57 ms returned sat
[2023-03-20 02:30:43] [INFO ] After 682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 1 ms to minimize.
[2023-03-20 02:30:43] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 0 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 1 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 1 ms to minimize.
[2023-03-20 02:30:44] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 0 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 0 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 0 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 0 ms to minimize.
[2023-03-20 02:30:45] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 0 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 1 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 0 ms to minimize.
[2023-03-20 02:30:46] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2023-03-20 02:30:47] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 1 ms to minimize.
[2023-03-20 02:30:47] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 1 ms to minimize.
[2023-03-20 02:30:47] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2023-03-20 02:30:47] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2023-03-20 02:30:47] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 0 ms to minimize.
[2023-03-20 02:30:47] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 0 ms to minimize.
[2023-03-20 02:30:48] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2023-03-20 02:30:48] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2023-03-20 02:30:48] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 13 ms to minimize.
[2023-03-20 02:30:48] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2023-03-20 02:30:48] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2023-03-20 02:30:48] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2023-03-20 02:30:49] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 0 ms to minimize.
[2023-03-20 02:30:49] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2023-03-20 02:30:49] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 1 ms to minimize.
[2023-03-20 02:30:49] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6178 ms
[2023-03-20 02:30:49] [INFO ] After 6907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 02:30:49] [INFO ] After 7249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 1341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 923
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1063 transition count 923
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 556 place count 1063 transition count 762
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 878 place count 902 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1556 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 563 transition count 422
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1559 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1677 place count 503 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 1735 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1736 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1737 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1737 place count 501 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1741 place count 499 transition count 418
Applied a total of 1741 rules in 112 ms. Remains 499 /1341 variables (removed 842) and now considering 418/1201 (removed 783) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 499/1341 places, 418/1201 transitions.
Finished random walk after 8341 steps, including 2 resets, run visited all 1 properties in 37 ms. (steps per millisecond=225 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 226 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 47 reset in 517 ms.
Product exploration explored 100000 steps with 48 reset in 531 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1341 transition count 1201
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 278 place count 1341 transition count 1280
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 378 place count 1341 transition count 1280
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 1 with 378 rules applied. Total rules applied 756 place count 1341 transition count 1280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 757 place count 1341 transition count 1279
Renaming transitions due to excessive name length > 1024 char.
Discarding 142 places :
Symmetric choice reduction at 2 with 142 rule applications. Total rules 899 place count 1199 transition count 1137
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 142 rules applied. Total rules applied 1041 place count 1199 transition count 1137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 615 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1042 place count 1199 transition count 1137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1044 place count 1197 transition count 1135
Deduced a syphon composed of 613 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1046 place count 1197 transition count 1135
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -333
Deduced a syphon composed of 692 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1125 place count 1197 transition count 1468
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1204 place count 1118 transition count 1310
Deduced a syphon composed of 613 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1283 place count 1118 transition count 1310
Deduced a syphon composed of 613 places in 1 ms
Applied a total of 1283 rules in 333 ms. Remains 1118 /1341 variables (removed 223) and now considering 1310/1201 (removed -109) transitions.
[2023-03-20 02:30:52] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1310 rows 1118 cols
[2023-03-20 02:30:52] [INFO ] Computed 221 place invariants in 13 ms
[2023-03-20 02:30:54] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1118/1341 places, 1310/1201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1958 ms. Remains : 1118/1341 places, 1310/1201 transitions.
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 84 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2023-03-20 02:30:54] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-20 02:30:55] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-20 02:30:55] [INFO ] Invariant cache hit.
[2023-03-20 02:30:56] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
[2023-03-20 02:30:56] [INFO ] Invariant cache hit.
[2023-03-20 02:30:57] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2756 ms. Remains : 1341/1341 places, 1201/1201 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-11 finished in 49439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 1349 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1348 transition count 929
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 1069 transition count 928
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 560 place count 1068 transition count 772
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 872 place count 912 transition count 772
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 879 place count 905 transition count 765
Iterating global reduction 3 with 7 rules applied. Total rules applied 886 place count 905 transition count 765
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 886 place count 905 transition count 760
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 896 place count 900 transition count 760
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 1564 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1565 place count 566 transition count 425
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1567 place count 565 transition count 424
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1685 place count 506 transition count 424
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1687 place count 504 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1688 place count 503 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1688 place count 503 transition count 420
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 1692 place count 501 transition count 420
Applied a total of 1692 rules in 129 ms. Remains 501 /1349 variables (removed 848) and now considering 420/1209 (removed 789) transitions.
// Phase 1: matrix 420 rows 501 cols
[2023-03-20 02:30:57] [INFO ] Computed 220 place invariants in 14 ms
[2023-03-20 02:30:57] [INFO ] Implicit Places using invariants in 349 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 350 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1349 places, 420/1209 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 418
Applied a total of 4 rules in 13 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2023-03-20 02:30:57] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:30:58] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-20 02:30:58] [INFO ] Invariant cache hit.
[2023-03-20 02:30:58] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1349 places, 418/1209 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1277 ms. Remains : 497/1349 places, 418/1209 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s347 1) (EQ s363 1)), p1:(NEQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 68 reset in 463 ms.
Product exploration explored 100000 steps with 67 reset in 505 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 348 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:31:00] [INFO ] Invariant cache hit.
[2023-03-20 02:31:00] [INFO ] [Real]Absence check using 218 positive place invariants in 52 ms returned sat
[2023-03-20 02:31:00] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:31:00] [INFO ] [Nat]Absence check using 218 positive place invariants in 48 ms returned sat
[2023-03-20 02:31:00] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:31:00] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-20 02:31:00] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 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 497 transition count 418
Applied a total of 1 rules in 26 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 497/497 places, 418/418 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 490976 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 490976 steps, saw 377042 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 418 rows 497 cols
[2023-03-20 02:31:03] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:31:04] [INFO ] [Real]Absence check using 218 positive place invariants in 55 ms returned sat
[2023-03-20 02:31:04] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:31:04] [INFO ] [Nat]Absence check using 218 positive place invariants in 39 ms returned sat
[2023-03-20 02:31:04] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:31:05] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-20 02:31:05] [INFO ] After 606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 16 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 497/497 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 13 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-20 02:31:05] [INFO ] Invariant cache hit.
[2023-03-20 02:31:05] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-20 02:31:05] [INFO ] Invariant cache hit.
[2023-03-20 02:31:05] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2023-03-20 02:31:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 02:31:05] [INFO ] Invariant cache hit.
[2023-03-20 02:31:06] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1088 ms. Remains : 497/497 places, 418/418 transitions.
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 497 transition count 418
Applied a total of 117 rules in 26 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 418 rows 497 cols
[2023-03-20 02:31:06] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:31:06] [INFO ] [Real]Absence check using 218 positive place invariants in 44 ms returned sat
[2023-03-20 02:31:06] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:31:06] [INFO ] [Nat]Absence check using 218 positive place invariants in 30 ms returned sat
[2023-03-20 02:31:06] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:31:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 02:31:07] [INFO ] After 63ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:31:07] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-20 02:31:07] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 429 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 18 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
// Phase 1: matrix 418 rows 497 cols
[2023-03-20 02:31:07] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:31:08] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-20 02:31:08] [INFO ] Invariant cache hit.
[2023-03-20 02:31:08] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2023-03-20 02:31:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 02:31:08] [INFO ] Invariant cache hit.
[2023-03-20 02:31:09] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1339 ms. Remains : 497/497 places, 418/418 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:31:09] [INFO ] Invariant cache hit.
[2023-03-20 02:31:09] [INFO ] [Real]Absence check using 218 positive place invariants in 59 ms returned sat
[2023-03-20 02:31:09] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:31:10] [INFO ] [Nat]Absence check using 218 positive place invariants in 63 ms returned sat
[2023-03-20 02:31:10] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:31:10] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-20 02:31:10] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 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 497 transition count 418
Applied a total of 1 rules in 14 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 497/497 places, 418/418 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 466548 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 466548 steps, saw 358838 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 418 rows 497 cols
[2023-03-20 02:31:13] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:31:13] [INFO ] [Real]Absence check using 218 positive place invariants in 62 ms returned sat
[2023-03-20 02:31:13] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:31:14] [INFO ] [Nat]Absence check using 218 positive place invariants in 33 ms returned sat
[2023-03-20 02:31:14] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:31:14] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-20 02:31:14] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 11 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 497/497 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 10 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-20 02:31:14] [INFO ] Invariant cache hit.
[2023-03-20 02:31:14] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-20 02:31:14] [INFO ] Invariant cache hit.
[2023-03-20 02:31:15] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2023-03-20 02:31:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 02:31:15] [INFO ] Invariant cache hit.
[2023-03-20 02:31:15] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1109 ms. Remains : 497/497 places, 418/418 transitions.
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 497 transition count 418
Applied a total of 117 rules in 27 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 418 rows 497 cols
[2023-03-20 02:31:15] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:31:15] [INFO ] [Real]Absence check using 218 positive place invariants in 26 ms returned sat
[2023-03-20 02:31:16] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:31:16] [INFO ] [Nat]Absence check using 218 positive place invariants in 24 ms returned sat
[2023-03-20 02:31:16] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:31:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 02:31:16] [INFO ] After 20ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:31:16] [INFO ] After 82ms 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-20 02:31:16] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 372 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 57 reset in 564 ms.
Product exploration explored 100000 steps with 71 reset in 663 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 7 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
// Phase 1: matrix 418 rows 497 cols
[2023-03-20 02:31:18] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:31:18] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-20 02:31:18] [INFO ] Invariant cache hit.
[2023-03-20 02:31:19] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2023-03-20 02:31:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 02:31:19] [INFO ] Invariant cache hit.
[2023-03-20 02:31:19] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1106 ms. Remains : 497/497 places, 418/418 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-12 finished in 22074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1))||(p2&&F(p3)))))'
Support contains 5 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 93 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-20 02:31:19] [INFO ] Computed 221 place invariants in 9 ms
[2023-03-20 02:31:19] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-20 02:31:19] [INFO ] Invariant cache hit.
[2023-03-20 02:31:21] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
[2023-03-20 02:31:21] [INFO ] Invariant cache hit.
[2023-03-20 02:31:21] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2610 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(EQ s35 0), p0:(EQ s484 1), p2:(EQ s936 1), p1:(OR (EQ s52 0) (EQ s54 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-13 finished in 2936 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' '!(((p0 U p1)||X((G(p2)&&F((p3&&X(p4)))))))'
Support contains 5 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1342 transition count 1202
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1342 transition count 1202
Applied a total of 14 rules in 106 ms. Remains 1342 /1349 variables (removed 7) and now considering 1202/1209 (removed 7) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2023-03-20 02:31:22] [INFO ] Computed 221 place invariants in 10 ms
[2023-03-20 02:31:22] [INFO ] Implicit Places using invariants in 544 ms returned []
[2023-03-20 02:31:23] [INFO ] Invariant cache hit.
[2023-03-20 02:31:24] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
[2023-03-20 02:31:24] [INFO ] Invariant cache hit.
[2023-03-20 02:31:25] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1349 places, 1202/1209 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2904 ms. Remains : 1342/1349 places, 1202/1209 transitions.
Stuttering acceptance computed with spot in 453 ms :[(OR (NOT p4) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (NOT p2), (AND (NOT p1) (NOT p2)), true, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p4) (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3))), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 p3 (NOT p4)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p4), acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p4)), acceptance={0} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2 p3 (NOT p4)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2 p3 (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 p4), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0 p2 p4), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 6}, { cond=(AND (NOT p1) p0 p2 (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 8}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND p2 p3), acceptance={0} source=6 dest: 0}, { cond=(NOT p2), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}]], initial=5, aps=[p2:(AND (EQ s970 1) (EQ s972 1)), p3:(EQ s870 0), p4:(EQ s207 0), p1:(EQ s870 1), p0:(EQ s1011 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, 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 ShieldPPPt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLFireability-14 finished in 3417 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)))'
Found a Lengthening insensitive property : ShieldPPPt-PT-020B-LTLFireability-09
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1348 transition count 928
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 560 place count 1068 transition count 773
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 870 place count 913 transition count 773
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 877 place count 906 transition count 766
Iterating global reduction 2 with 7 rules applied. Total rules applied 884 place count 906 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 884 place count 906 transition count 761
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 894 place count 901 transition count 761
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1566 place count 565 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1567 place count 565 transition count 424
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1569 place count 564 transition count 423
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1685 place count 506 transition count 423
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1687 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1688 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1688 place count 503 transition count 419
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1692 place count 501 transition count 419
Applied a total of 1692 rules in 130 ms. Remains 501 /1349 variables (removed 848) and now considering 419/1209 (removed 790) transitions.
// Phase 1: matrix 419 rows 501 cols
[2023-03-20 02:31:26] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-20 02:31:26] [INFO ] Implicit Places using invariants in 304 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 305 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 499/1349 places, 419/1209 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 417
Applied a total of 4 rules in 11 ms. Remains 497 /499 variables (removed 2) and now considering 417/419 (removed 2) transitions.
// Phase 1: matrix 417 rows 497 cols
[2023-03-20 02:31:26] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:31:26] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-20 02:31:26] [INFO ] Invariant cache hit.
[2023-03-20 02:31:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:31:27] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 497/1349 places, 417/1209 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1216 ms. Remains : 497/1349 places, 417/1209 transitions.
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s430 1) (NEQ s76 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 490 ms.
Product exploration explored 100000 steps with 0 reset in 596 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 451 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Finished Best-First random walk after 238 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=119 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 417/417 transitions.
Applied a total of 0 rules in 11 ms. Remains 497 /497 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-20 02:31:29] [INFO ] Invariant cache hit.
[2023-03-20 02:31:29] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-20 02:31:29] [INFO ] Invariant cache hit.
[2023-03-20 02:31:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:31:30] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2023-03-20 02:31:30] [INFO ] Invariant cache hit.
[2023-03-20 02:31:30] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1135 ms. Remains : 497/497 places, 417/417 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Finished Best-First random walk after 833 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=277 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 446 ms.
Product exploration explored 100000 steps with 0 reset in 628 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 417/417 transitions.
Applied a total of 0 rules in 10 ms. Remains 497 /497 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-20 02:31:32] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 02:31:32] [INFO ] Invariant cache hit.
[2023-03-20 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 497/497 places, 417/417 transitions.
Support contains 2 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 417/417 transitions.
Applied a total of 0 rules in 17 ms. Remains 497 /497 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-20 02:31:32] [INFO ] Invariant cache hit.
[2023-03-20 02:31:33] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-20 02:31:33] [INFO ] Invariant cache hit.
[2023-03-20 02:31:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:31:33] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-20 02:31:33] [INFO ] Invariant cache hit.
[2023-03-20 02:31:33] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1124 ms. Remains : 497/497 places, 417/417 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-09 finished in 8322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&X(X(F(p1)))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-020B-LTLFireability-11
Stuttering acceptance computed with spot in 387 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Support contains 4 out of 1349 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1349/1349 places, 1209/1209 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1348 transition count 928
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1068 transition count 928
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 560 place count 1068 transition count 772
Deduced a syphon composed of 156 places in 2 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 872 place count 912 transition count 772
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 879 place count 905 transition count 765
Iterating global reduction 2 with 7 rules applied. Total rules applied 886 place count 905 transition count 765
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 886 place count 905 transition count 760
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 896 place count 900 transition count 760
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 2 with 668 rules applied. Total rules applied 1564 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1565 place count 566 transition count 425
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1567 place count 565 transition count 424
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1685 place count 506 transition count 424
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1687 place count 504 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1688 place count 503 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1688 place count 503 transition count 420
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1692 place count 501 transition count 420
Applied a total of 1692 rules in 203 ms. Remains 501 /1349 variables (removed 848) and now considering 420/1209 (removed 789) transitions.
// Phase 1: matrix 420 rows 501 cols
[2023-03-20 02:31:34] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-20 02:31:35] [INFO ] Implicit Places using invariants in 373 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 387 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 499/1349 places, 420/1209 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 418
Applied a total of 4 rules in 13 ms. Remains 497 /499 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 497 cols
[2023-03-20 02:31:35] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:31:35] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-20 02:31:35] [INFO ] Invariant cache hit.
[2023-03-20 02:31:36] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 497/1349 places, 418/1209 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1590 ms. Remains : 497/1349 places, 418/1209 transitions.
Running random walk in product with property : ShieldPPPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s383 1) (EQ s399 1)), p1:(AND (EQ s220 1) (EQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 206 reset in 508 ms.
Product exploration explored 100000 steps with 195 reset in 503 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 4151 steps, including 1 resets, run visited all 2 properties in 24 ms. (steps per millisecond=172 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 10 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-20 02:31:38] [INFO ] Invariant cache hit.
[2023-03-20 02:31:38] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-20 02:31:38] [INFO ] Invariant cache hit.
[2023-03-20 02:31:39] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2023-03-20 02:31:39] [INFO ] Invariant cache hit.
[2023-03-20 02:31:39] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 988 ms. Remains : 497/497 places, 418/418 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 9070 steps, including 2 resets, run visited all 2 properties in 49 ms. (steps per millisecond=185 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 187 reset in 445 ms.
Product exploration explored 100000 steps with 207 reset in 481 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 14 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-20 02:31:42] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 02:31:42] [INFO ] Invariant cache hit.
[2023-03-20 02:31:42] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 425 ms. Remains : 497/497 places, 418/418 transitions.
Support contains 4 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 418/418 transitions.
Applied a total of 0 rules in 3 ms. Remains 497 /497 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-20 02:31:42] [INFO ] Invariant cache hit.
[2023-03-20 02:31:42] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-20 02:31:42] [INFO ] Invariant cache hit.
[2023-03-20 02:31:43] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2023-03-20 02:31:43] [INFO ] Invariant cache hit.
[2023-03-20 02:31:43] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1068 ms. Remains : 497/497 places, 418/418 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLFireability-11 finished in 9545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
[2023-03-20 02:31:43] [INFO ] Flatten gal took : 38 ms
[2023-03-20 02:31:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 02:31:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1349 places, 1209 transitions and 3138 arcs took 19 ms.
Total runtime 220062 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-020B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLFireability

FORMULA ShieldPPPt-PT-020B-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679279654306

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldPPPt-PT-020B-LTLFireability-12
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ShieldPPPt-PT-020B-LTLFireability-12
lola: result : false
lola: markings : 3907
lola: fired transitions : 4455
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldPPPt-PT-020B-LTLFireability-11
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1799 3/32 ShieldPPPt-PT-020B-LTLFireability-11 254010 m, 50802 m/sec, 645125 t fired, .

Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1799 6/32 ShieldPPPt-PT-020B-LTLFireability-11 472915 m, 43781 m/sec, 1330649 t fired, .

Time elapsed: 11 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1799 8/32 ShieldPPPt-PT-020B-LTLFireability-11 696259 m, 44668 m/sec, 2006156 t fired, .

Time elapsed: 16 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1799 10/32 ShieldPPPt-PT-020B-LTLFireability-11 917512 m, 44250 m/sec, 2687794 t fired, .

Time elapsed: 21 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1799 13/32 ShieldPPPt-PT-020B-LTLFireability-11 1121144 m, 40726 m/sec, 3370720 t fired, .

Time elapsed: 26 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1799 15/32 ShieldPPPt-PT-020B-LTLFireability-11 1361255 m, 48022 m/sec, 4045442 t fired, .

Time elapsed: 31 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1799 17/32 ShieldPPPt-PT-020B-LTLFireability-11 1561057 m, 39960 m/sec, 4729045 t fired, .

Time elapsed: 36 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1799 19/32 ShieldPPPt-PT-020B-LTLFireability-11 1730393 m, 33867 m/sec, 5421712 t fired, .

Time elapsed: 41 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1799 21/32 ShieldPPPt-PT-020B-LTLFireability-11 1898465 m, 33614 m/sec, 6109131 t fired, .

Time elapsed: 46 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1799 23/32 ShieldPPPt-PT-020B-LTLFireability-11 2108049 m, 41916 m/sec, 6788494 t fired, .

Time elapsed: 51 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1799 25/32 ShieldPPPt-PT-020B-LTLFireability-11 2270164 m, 32423 m/sec, 7484902 t fired, .

Time elapsed: 56 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1799 27/32 ShieldPPPt-PT-020B-LTLFireability-11 2478161 m, 41599 m/sec, 8161467 t fired, .

Time elapsed: 61 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1799 30/32 ShieldPPPt-PT-020B-LTLFireability-11 2728843 m, 50136 m/sec, 8828789 t fired, .

Time elapsed: 66 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1799 32/32 ShieldPPPt-PT-020B-LTLFireability-11 2927409 m, 39713 m/sec, 9514946 t fired, .

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for ShieldPPPt-PT-020B-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPt-PT-020B-LTLFireability-09
lola: time limit : 3524 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3524 3/32 ShieldPPPt-PT-020B-LTLFireability-09 271349 m, 54269 m/sec, 687419 t fired, .

Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3524 6/32 ShieldPPPt-PT-020B-LTLFireability-09 489332 m, 43596 m/sec, 1380229 t fired, .

Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3524 8/32 ShieldPPPt-PT-020B-LTLFireability-09 716323 m, 45398 m/sec, 2065270 t fired, .

Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3524 11/32 ShieldPPPt-PT-020B-LTLFireability-09 935066 m, 43748 m/sec, 2755418 t fired, .

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3524 13/32 ShieldPPPt-PT-020B-LTLFireability-09 1144551 m, 41897 m/sec, 3442627 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3524 15/32 ShieldPPPt-PT-020B-LTLFireability-09 1381696 m, 47429 m/sec, 4126375 t fired, .

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3524 18/32 ShieldPPPt-PT-020B-LTLFireability-09 1587496 m, 41160 m/sec, 4814938 t fired, .

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3524 19/32 ShieldPPPt-PT-020B-LTLFireability-09 1753417 m, 33184 m/sec, 5512985 t fired, .

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3524 21/32 ShieldPPPt-PT-020B-LTLFireability-09 1923406 m, 33997 m/sec, 6203801 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3524 24/32 ShieldPPPt-PT-020B-LTLFireability-09 2129508 m, 41220 m/sec, 6891036 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3524 25/32 ShieldPPPt-PT-020B-LTLFireability-09 2294233 m, 32945 m/sec, 7588553 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3524 28/32 ShieldPPPt-PT-020B-LTLFireability-09 2516114 m, 44376 m/sec, 8263832 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3524 30/32 ShieldPPPt-PT-020B-LTLFireability-09 2760637 m, 48904 m/sec, 8936914 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3524 32/32 ShieldPPPt-PT-020B-LTLFireability-09 2959797 m, 39832 m/sec, 9625008 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for ShieldPPPt-PT-020B-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLFireability-09: LTL unknown AGGR
ShieldPPPt-PT-020B-LTLFireability-11: LTL unknown AGGR
ShieldPPPt-PT-020B-LTLFireability-12: LTL false LTL model checker


Time elapsed: 151 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPt-PT-020B, 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 r391-oct2-167903715500636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B 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 ;