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-167903715500635.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715500635
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1679279271758

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:27:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 02:27:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:27:53] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-20 02:27:53] [INFO ] Transformed 1563 places.
[2023-03-20 02:27:53] [INFO ] Transformed 1423 transitions.
[2023-03-20 02:27:53] [INFO ] Found NUPN structural information;
[2023-03-20 02:27:54] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 216 places :
Symmetric choice reduction at 0 with 216 rule applications. Total rules 216 place count 1347 transition count 1207
Iterating global reduction 0 with 216 rules applied. Total rules applied 432 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 433 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 434 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 435 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 436 place count 1345 transition count 1205
Applied a total of 436 rules in 589 ms. Remains 1345 /1563 variables (removed 218) and now considering 1205/1423 (removed 218) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2023-03-20 02:27:54] [INFO ] Computed 221 place invariants in 24 ms
[2023-03-20 02:27:55] [INFO ] Implicit Places using invariants in 1114 ms returned []
[2023-03-20 02:27:55] [INFO ] Invariant cache hit.
[2023-03-20 02:27:57] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 2805 ms to find 0 implicit places.
[2023-03-20 02:27:57] [INFO ] Invariant cache hit.
[2023-03-20 02:27:58] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1345/1563 places, 1205/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4220 ms. Remains : 1345/1563 places, 1205/1423 transitions.
Support contains 23 out of 1345 places after structural reductions.
[2023-03-20 02:27:58] [INFO ] Flatten gal took : 125 ms
[2023-03-20 02:27:58] [INFO ] Flatten gal took : 52 ms
[2023-03-20 02:27:59] [INFO ] Input system was already deterministic with 1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-20 02:27:59] [INFO ] Invariant cache hit.
[2023-03-20 02:28:00] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 02:28:00] [INFO ] [Nat]Absence check using 221 positive place invariants in 64 ms returned sat
[2023-03-20 02:28:02] [INFO ] After 1348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 02:28:02] [INFO ] Deduced a trap composed of 25 places in 448 ms of which 23 ms to minimize.
[2023-03-20 02:28:03] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 1 ms to minimize.
[2023-03-20 02:28:03] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 1 ms to minimize.
[2023-03-20 02:28:03] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:28:03] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 1 ms to minimize.
[2023-03-20 02:28:04] [INFO ] Deduced a trap composed of 16 places in 291 ms of which 1 ms to minimize.
[2023-03-20 02:28:04] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 1 ms to minimize.
[2023-03-20 02:28:04] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 1 ms to minimize.
[2023-03-20 02:28:05] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 1 ms to minimize.
[2023-03-20 02:28:05] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 1 ms to minimize.
[2023-03-20 02:28:05] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 0 ms to minimize.
[2023-03-20 02:28:05] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2023-03-20 02:28:06] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 0 ms to minimize.
[2023-03-20 02:28:06] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 0 ms to minimize.
[2023-03-20 02:28:06] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 0 ms to minimize.
[2023-03-20 02:28:06] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 1 ms to minimize.
[2023-03-20 02:28:07] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 1 ms to minimize.
[2023-03-20 02:28:07] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 0 ms to minimize.
[2023-03-20 02:28:07] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 14 ms to minimize.
[2023-03-20 02:28:08] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 0 ms to minimize.
[2023-03-20 02:28:08] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 1 ms to minimize.
[2023-03-20 02:28:08] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 1 ms to minimize.
[2023-03-20 02:28:08] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2023-03-20 02:28:08] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 1 ms to minimize.
[2023-03-20 02:28:09] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 2 ms to minimize.
[2023-03-20 02:28:09] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 2 ms to minimize.
[2023-03-20 02:28:09] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2023-03-20 02:28:10] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 1 ms to minimize.
[2023-03-20 02:28:10] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 1 ms to minimize.
[2023-03-20 02:28:10] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8310 ms
[2023-03-20 02:28:10] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2023-03-20 02:28:11] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2023-03-20 02:28:11] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 0 ms to minimize.
[2023-03-20 02:28:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 704 ms
[2023-03-20 02:28:12] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 0 ms to minimize.
[2023-03-20 02:28:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-20 02:28:12] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 0 ms to minimize.
[2023-03-20 02:28:12] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 0 ms to minimize.
[2023-03-20 02:28:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2023-03-20 02:28:12] [INFO ] After 11860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 710 ms.
[2023-03-20 02:28:13] [INFO ] After 13176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 2 properties in 363 ms.
Support contains 12 out of 1345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1345 transition count 929
Reduce places removed 276 places and 0 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 552 place count 1069 transition count 929
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 552 place count 1069 transition count 774
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 862 place count 914 transition count 774
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 863 place count 913 transition count 773
Iterating global reduction 2 with 1 rules applied. Total rules applied 864 place count 913 transition count 773
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 864 place count 913 transition count 772
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 866 place count 912 transition count 772
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 1544 place count 573 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1545 place count 573 transition count 432
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 1547 place count 572 transition count 431
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 3 with 110 rules applied. Total rules applied 1657 place count 517 transition count 431
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 1716 place count 517 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1717 place count 516 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1718 place count 515 transition count 430
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1718 place count 515 transition count 428
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 1722 place count 513 transition count 428
Applied a total of 1722 rules in 238 ms. Remains 513 /1345 variables (removed 832) and now considering 428/1205 (removed 777) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 513/1345 places, 428/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) 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 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
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 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 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
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
Interrupted probabilistic random walk after 133300 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133300 steps, saw 103165 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 428 rows 513 cols
[2023-03-20 02:28:17] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-20 02:28:17] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:28:17] [INFO ] [Nat]Absence check using 220 positive place invariants in 57 ms returned sat
[2023-03-20 02:28:18] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:28:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:18] [INFO ] After 194ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 02:28:18] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2023-03-20 02:28:18] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2023-03-20 02:28:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 382 ms
[2023-03-20 02:28:19] [INFO ] After 813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 250 ms.
[2023-03-20 02:28:19] [INFO ] After 1701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 102 ms.
Support contains 12 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 428/428 transitions.
Applied a total of 0 rules in 18 ms. Remains 513 /513 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 513/513 places, 428/428 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 428/428 transitions.
Applied a total of 0 rules in 15 ms. Remains 513 /513 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2023-03-20 02:28:19] [INFO ] Invariant cache hit.
[2023-03-20 02:28:19] [INFO ] Implicit Places using invariants in 305 ms returned [496, 500]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 306 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 511/513 places, 428/428 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 509 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 509 transition count 426
Applied a total of 4 rules in 16 ms. Remains 509 /511 variables (removed 2) and now considering 426/428 (removed 2) transitions.
// Phase 1: matrix 426 rows 509 cols
[2023-03-20 02:28:19] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:28:20] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-20 02:28:20] [INFO ] Invariant cache hit.
[2023-03-20 02:28:20] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 509/513 places, 426/428 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1105 ms. Remains : 509/513 places, 426/428 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 02:28:21] [INFO ] Invariant cache hit.
[2023-03-20 02:28:21] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:28:21] [INFO ] [Nat]Absence check using 218 positive place invariants in 29 ms returned sat
[2023-03-20 02:28:21] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:21] [INFO ] After 564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-20 02:28:22] [INFO ] After 920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 8 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 426/426 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 509 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 507 transition count 424
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 8 place count 505 transition count 422
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 503 transition count 422
Applied a total of 12 rules in 51 ms. Remains 503 /509 variables (removed 6) and now considering 422/426 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 503/509 places, 422/426 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) 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 5) seen :4
Running SMT prover for 1 properties.
// Phase 1: matrix 422 rows 503 cols
[2023-03-20 02:28:22] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:28:22] [INFO ] [Real]Absence check using 218 positive place invariants in 28 ms returned sat
[2023-03-20 02:28:22] [INFO ] After 172ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 02:28:23] [INFO ] After 214ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-20 02:28:23] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 422/422 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 503 transition count 419
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 419
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 496 transition count 415
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 0 with 4 rules applied. Total rules applied 18 place count 494 transition count 415
Applied a total of 18 rules in 59 ms. Remains 494 /503 variables (removed 9) and now considering 415/422 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 494/503 places, 415/422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 405079 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 405079 steps, saw 273213 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 415 rows 494 cols
[2023-03-20 02:28:26] [INFO ] Computed 218 place invariants in 4 ms
[2023-03-20 02:28:26] [INFO ] [Real]Absence check using 218 positive place invariants in 48 ms returned sat
[2023-03-20 02:28:26] [INFO ] After 353ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 02:28:26] [INFO ] After 413ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-20 02:28:26] [INFO ] After 616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 415/415 transitions.
Applied a total of 0 rules in 12 ms. Remains 494 /494 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 494/494 places, 415/415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 415/415 transitions.
Applied a total of 0 rules in 12 ms. Remains 494 /494 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-20 02:28:26] [INFO ] Invariant cache hit.
[2023-03-20 02:28:27] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-20 02:28:27] [INFO ] Invariant cache hit.
[2023-03-20 02:28:27] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-03-20 02:28:27] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-20 02:28:27] [INFO ] Invariant cache hit.
[2023-03-20 02:28:28] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1218 ms. Remains : 494/494 places, 415/415 transitions.
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 115 place count 494 transition count 415
Applied a total of 115 rules in 46 ms. Remains 494 /494 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 415 rows 494 cols
[2023-03-20 02:28:28] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:28:28] [INFO ] [Real]Absence check using 218 positive place invariants in 34 ms returned sat
[2023-03-20 02:28:28] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 02:28:28] [INFO ] State equation strengthened by 113 read => feed constraints.
[2023-03-20 02:28:28] [INFO ] After 45ms SMT Verify possible using 113 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:28:28] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:28:28] [INFO ] [Nat]Absence check using 218 positive place invariants in 36 ms returned sat
[2023-03-20 02:28:28] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:28:28] [INFO ] After 97ms SMT Verify possible using 113 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:28:29] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 13 ms to minimize.
[2023-03-20 02:28:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-20 02:28:29] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-20 02:28:29] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldPPPt-PT-020B-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 319 stabilizing places and 319 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' '!(G(F(p0)))'
Support contains 1 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 560 place count 1064 transition count 765
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 878 place count 905 transition count 765
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 881 place count 902 transition count 762
Iterating global reduction 2 with 3 rules applied. Total rules applied 884 place count 902 transition count 762
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 884 place count 902 transition count 760
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 888 place count 900 transition count 760
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 1562 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 1563 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1565 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 1683 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1686 place count 500 transition count 417
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 1690 place count 498 transition count 417
Applied a total of 1690 rules in 171 ms. Remains 498 /1345 variables (removed 847) and now considering 417/1205 (removed 788) transitions.
// Phase 1: matrix 417 rows 498 cols
[2023-03-20 02:28:29] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-20 02:28:30] [INFO ] Implicit Places using invariants in 299 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 300 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1345 places, 417/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 415
Applied a total of 4 rules in 16 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2023-03-20 02:28:30] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:28:30] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-20 02:28:30] [INFO ] Invariant cache hit.
[2023-03-20 02:28:30] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1345 places, 415/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1221 ms. Remains : 494/1345 places, 415/1205 transitions.
Stuttering acceptance computed with spot in 357 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-01 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 s435 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 247 reset in 626 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-01 finished in 2287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((!p0 U ((p1 U p2)||F(p1)))) U p0))))'
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 926
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 1066 transition count 925
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 1065 transition count 925
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 558 place count 1065 transition count 769
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 870 place count 909 transition count 769
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 872 place count 907 transition count 767
Iterating global reduction 3 with 2 rules applied. Total rules applied 874 place count 907 transition count 767
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 874 place count 907 transition count 766
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 876 place count 906 transition count 766
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 1 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1550 place count 569 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1551 place count 569 transition count 428
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1553 place count 568 transition count 427
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 1667 place count 511 transition count 427
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1669 place count 509 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1670 place count 508 transition count 425
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1670 place count 508 transition count 423
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 1674 place count 506 transition count 423
Applied a total of 1674 rules in 221 ms. Remains 506 /1345 variables (removed 839) and now considering 423/1205 (removed 782) transitions.
// Phase 1: matrix 423 rows 506 cols
[2023-03-20 02:28:32] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-20 02:28:32] [INFO ] Implicit Places using invariants in 302 ms returned [489, 493]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 303 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1345 places, 423/1205 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 502 transition count 421
Applied a total of 4 rules in 14 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:32] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:28:32] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-20 02:28:32] [INFO ] Invariant cache hit.
[2023-03-20 02:28:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:33] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 502/1345 places, 421/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1551 ms. Remains : 502/1345 places, 421/1205 transitions.
Stuttering acceptance computed with spot in 547 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s223 0) (EQ s435 1)), p2:(EQ s125 1), p1:(OR (EQ s22 0) (EQ s258 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 529 ms.
Product exploration explored 100000 steps with 0 reset in 680 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 1006 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 387 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 02:28:37] [INFO ] Invariant cache hit.
[2023-03-20 02:28:37] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:28:37] [INFO ] [Nat]Absence check using 218 positive place invariants in 34 ms returned sat
[2023-03-20 02:28:37] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:37] [INFO ] After 91ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:38] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-20 02:28:38] [INFO ] After 1086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 43 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 17 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 17 ms. Remains : 502/502 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 158425 steps, run timeout after 3020 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158425 steps, saw 114595 distinct states, run finished after 3021 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-20 02:28:41] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:28:41] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:28:41] [INFO ] [Nat]Absence check using 218 positive place invariants in 32 ms returned sat
[2023-03-20 02:28:42] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:42] [INFO ] After 135ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:42] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-20 02:28:42] [INFO ] After 1002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 5 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 12 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 12 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 9 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2023-03-20 02:28:42] [INFO ] Invariant cache hit.
[2023-03-20 02:28:43] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-20 02:28:43] [INFO ] Invariant cache hit.
[2023-03-20 02:28:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:43] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2023-03-20 02:28:43] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 02:28:43] [INFO ] Invariant cache hit.
[2023-03-20 02:28:43] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1085 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 29 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-20 02:28:43] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:28:44] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:28:44] [INFO ] [Nat]Absence check using 218 positive place invariants in 43 ms returned sat
[2023-03-20 02:28:44] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 02:28:44] [INFO ] After 92ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:44] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-20 02:28:45] [INFO ] After 1002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 820 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 401 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-20 02:28:46] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:28:47] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-20 02:28:47] [INFO ] Invariant cache hit.
[2023-03-20 02:28:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:47] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2023-03-20 02:28:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 02:28:47] [INFO ] Invariant cache hit.
[2023-03-20 02:28:47] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1080 ms. Remains : 502/502 places, 421/421 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 464 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 02:28:48] [INFO ] Invariant cache hit.
[2023-03-20 02:28:49] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:28:49] [INFO ] [Nat]Absence check using 218 positive place invariants in 57 ms returned sat
[2023-03-20 02:28:49] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:49] [INFO ] After 144ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:50] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-20 02:28:50] [INFO ] After 1188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 54 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 20 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 20 ms. Remains : 502/502 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 162807 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162807 steps, saw 117643 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-20 02:28:53] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:28:53] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:28:53] [INFO ] [Nat]Absence check using 218 positive place invariants in 28 ms returned sat
[2023-03-20 02:28:54] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:54] [INFO ] After 154ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:54] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-20 02:28:54] [INFO ] After 984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 51 ms.
Support contains 5 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 7 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 7 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 7 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2023-03-20 02:28:54] [INFO ] Invariant cache hit.
[2023-03-20 02:28:55] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-20 02:28:55] [INFO ] Invariant cache hit.
[2023-03-20 02:28:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:28:55] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-20 02:28:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 02:28:55] [INFO ] Invariant cache hit.
[2023-03-20 02:28:55] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1026 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 42 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-20 02:28:55] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:28:56] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 02:28:56] [INFO ] [Nat]Absence check using 218 positive place invariants in 30 ms returned sat
[2023-03-20 02:28:56] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 02:28:56] [INFO ] After 99ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 02:28:56] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2023-03-20 02:28:56] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 15 ms to minimize.
[2023-03-20 02:28:56] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-03-20 02:28:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2023-03-20 02:28:56] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2023-03-20 02:28:57] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2023-03-20 02:28:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2023-03-20 02:28:57] [INFO ] After 866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-20 02:28:57] [INFO ] After 1437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 951 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 631 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 431 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 462 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 535 ms.
Product exploration explored 100000 steps with 0 reset in 700 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-20 02:29:01] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-20 02:29:01] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-20 02:29:01] [INFO ] Invariant cache hit.
[2023-03-20 02:29:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:29:02] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2023-03-20 02:29:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 02:29:02] [INFO ] Invariant cache hit.
[2023-03-20 02:29:02] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1224 ms. Remains : 502/502 places, 421/421 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-02 finished in 30774 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)&&F(p1))))'
Support contains 4 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 925
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1065 transition count 925
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 558 place count 1065 transition count 767
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 874 place count 907 transition count 767
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 876 place count 905 transition count 765
Iterating global reduction 2 with 2 rules applied. Total rules applied 878 place count 905 transition count 765
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 878 place count 905 transition count 763
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 882 place count 903 transition count 763
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1554 place count 567 transition count 427
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 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 3 with 2 rules applied. Total rules applied 1557 place count 566 transition count 425
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 1675 place count 507 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1677 place count 505 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1678 place count 504 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1678 place count 504 transition count 421
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 1682 place count 502 transition count 421
Applied a total of 1682 rules in 152 ms. Remains 502 /1345 variables (removed 843) and now considering 421/1205 (removed 784) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-20 02:29:02] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-20 02:29:03] [INFO ] Implicit Places using invariants in 299 ms returned [485, 489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 300 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1345 places, 421/1205 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 498 transition count 419
Applied a total of 4 rules in 15 ms. Remains 498 /500 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 498 cols
[2023-03-20 02:29:03] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:29:03] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-20 02:29:03] [INFO ] Invariant cache hit.
[2023-03-20 02:29:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:29:03] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 498/1345 places, 419/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1178 ms. Remains : 498/1345 places, 419/1205 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s52 0) (EQ s334 1)), p1:(OR (EQ s56 0) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 522 ms.
Product exploration explored 100000 steps with 1 reset in 589 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 337 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:29:05] [INFO ] Invariant cache hit.
[2023-03-20 02:29:05] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:29:06] [INFO ] [Nat]Absence check using 218 positive place invariants in 50 ms returned sat
[2023-03-20 02:29:06] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:29:06] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:06] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-20 02:29:06] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2023-03-20 02:29:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-03-20 02:29:06] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-20 02:29:06] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 419/419 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 498 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 497 transition count 418
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 497 transition count 418
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 495 transition count 416
Applied a total of 5 rules in 42 ms. Remains 495 /498 variables (removed 3) and now considering 416/419 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 495/498 places, 416/419 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) 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 473569 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 473569 steps, saw 353042 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2023-03-20 02:29:09] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-20 02:29:09] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:29:09] [INFO ] [Nat]Absence check using 218 positive place invariants in 44 ms returned sat
[2023-03-20 02:29:10] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:10] [INFO ] After 269ms 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:29:10] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 12 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 495/495 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 13 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-03-20 02:29:10] [INFO ] Invariant cache hit.
[2023-03-20 02:29:10] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-20 02:29:10] [INFO ] Invariant cache hit.
[2023-03-20 02:29:11] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2023-03-20 02:29:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 02:29:11] [INFO ] Invariant cache hit.
[2023-03-20 02:29:11] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1042 ms. Remains : 495/495 places, 416/416 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 495 transition count 416
Applied a total of 116 rules in 19 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2023-03-20 02:29:11] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:29:11] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:29:11] [INFO ] [Nat]Absence check using 218 positive place invariants in 47 ms returned sat
[2023-03-20 02:29:11] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:29:11] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:11] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-20 02:29:11] [INFO ] After 448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 329 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 419/419 transitions.
Applied a total of 0 rules in 16 ms. Remains 498 /498 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 498 cols
[2023-03-20 02:29:12] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:29:12] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-20 02:29:12] [INFO ] Invariant cache hit.
[2023-03-20 02:29:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:29:13] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2023-03-20 02:29:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 02:29:13] [INFO ] Invariant cache hit.
[2023-03-20 02:29:13] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1205 ms. Remains : 498/498 places, 419/419 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 263 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:29:14] [INFO ] Invariant cache hit.
[2023-03-20 02:29:14] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:29:14] [INFO ] [Nat]Absence check using 218 positive place invariants in 34 ms returned sat
[2023-03-20 02:29:14] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:29:14] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-20 02:29:14] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-20 02:29:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2023-03-20 02:29:14] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-20 02:29:14] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 419/419 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 498 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 497 transition count 418
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 497 transition count 418
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 495 transition count 416
Applied a total of 5 rules in 51 ms. Remains 495 /498 variables (removed 3) and now considering 416/419 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 495/498 places, 416/419 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 519386 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 519386 steps, saw 384742 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2023-03-20 02:29:18] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-20 02:29:18] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:29:18] [INFO ] [Nat]Absence check using 218 positive place invariants in 25 ms returned sat
[2023-03-20 02:29:18] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:18] [INFO ] After 191ms 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:29:18] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 495/495 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 6 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-03-20 02:29:18] [INFO ] Invariant cache hit.
[2023-03-20 02:29:18] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-20 02:29:18] [INFO ] Invariant cache hit.
[2023-03-20 02:29:19] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2023-03-20 02:29:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 02:29:19] [INFO ] Invariant cache hit.
[2023-03-20 02:29:19] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 903 ms. Remains : 495/495 places, 416/416 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 495 transition count 416
Applied a total of 116 rules in 14 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2023-03-20 02:29:19] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-20 02:29:19] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:29:19] [INFO ] [Nat]Absence check using 218 positive place invariants in 41 ms returned sat
[2023-03-20 02:29:19] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:29:19] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:29:19] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-20 02:29:20] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 343 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5 reset in 481 ms.
Product exploration explored 100000 steps with 3 reset in 541 ms.
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 419/419 transitions.
Applied a total of 0 rules in 8 ms. Remains 498 /498 variables (removed 0) and now considering 419/419 (removed 0) transitions.
// Phase 1: matrix 419 rows 498 cols
[2023-03-20 02:29:21] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-20 02:29:22] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-20 02:29:22] [INFO ] Invariant cache hit.
[2023-03-20 02:29:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:29:22] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-20 02:29:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 02:29:22] [INFO ] Invariant cache hit.
[2023-03-20 02:29:22] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1062 ms. Remains : 498/498 places, 419/419 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-03 finished in 20467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1064 transition count 766
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 906 transition count 766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 879 place count 903 transition count 763
Iterating global reduction 2 with 3 rules applied. Total rules applied 882 place count 903 transition count 763
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 882 place count 903 transition count 761
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 886 place count 901 transition count 761
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1562 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 1563 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 1565 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 1683 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1686 place count 500 transition count 417
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 1690 place count 498 transition count 417
Applied a total of 1690 rules in 135 ms. Remains 498 /1345 variables (removed 847) and now considering 417/1205 (removed 788) transitions.
// Phase 1: matrix 417 rows 498 cols
[2023-03-20 02:29:23] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-20 02:29:23] [INFO ] Implicit Places using invariants in 274 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 274 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1345 places, 417/1205 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 494 transition count 415
Applied a total of 4 rules in 11 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2023-03-20 02:29:23] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:29:23] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-20 02:29:23] [INFO ] Invariant cache hit.
[2023-03-20 02:29:24] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1345 places, 415/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1148 ms. Remains : 494/1345 places, 415/1205 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-06 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:(OR (EQ s380 0) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 189 reset in 377 ms.
Stack based approach found an accepted trace after 5487 steps with 10 reset with depth 943 and stack size 870 in 26 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-06 finished in 1649 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((G(p2)||p1)))))'
Support contains 4 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1343 transition count 1203
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1343 transition count 1203
Applied a total of 4 rules in 88 ms. Remains 1343 /1345 variables (removed 2) and now considering 1203/1205 (removed 2) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2023-03-20 02:29:24] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-20 02:29:25] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-20 02:29:25] [INFO ] Invariant cache hit.
[2023-03-20 02:29:26] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 2118 ms to find 0 implicit places.
[2023-03-20 02:29:26] [INFO ] Invariant cache hit.
[2023-03-20 02:29:27] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1343/1345 places, 1203/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2919 ms. Remains : 1343/1345 places, 1203/1205 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p2:(OR (EQ s66 0) (EQ s903 1)), p1:(OR (EQ s649 0) (EQ s1074 1)), p0:(OR (EQ s649 0) (EQ s1074 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]]
Product exploration explored 100000 steps with 0 reset in 513 ms.
Product exploration explored 100000 steps with 0 reset in 559 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 p2 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 428 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 02:29:29] [INFO ] Invariant cache hit.
[2023-03-20 02:29:30] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:29:30] [INFO ] [Nat]Absence check using 221 positive place invariants in 69 ms returned sat
[2023-03-20 02:29:30] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 1 ms to minimize.
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 1 ms to minimize.
[2023-03-20 02:29:31] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 1 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 0 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 1 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2023-03-20 02:29:32] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 1 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 1 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 0 ms to minimize.
[2023-03-20 02:29:33] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 1 ms to minimize.
[2023-03-20 02:29:34] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2023-03-20 02:29:34] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 1 ms to minimize.
[2023-03-20 02:29:34] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 1 ms to minimize.
[2023-03-20 02:29:35] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 1 ms to minimize.
[2023-03-20 02:29:35] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 0 ms to minimize.
[2023-03-20 02:29:35] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 1 ms to minimize.
[2023-03-20 02:29:35] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 0 ms to minimize.
[2023-03-20 02:29:36] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 1 ms to minimize.
[2023-03-20 02:29:36] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 0 ms to minimize.
[2023-03-20 02:29:36] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 1 ms to minimize.
[2023-03-20 02:29:36] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2023-03-20 02:29:36] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2023-03-20 02:29:37] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2023-03-20 02:29:37] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 0 ms to minimize.
[2023-03-20 02:29:37] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 2 ms to minimize.
[2023-03-20 02:29:37] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2023-03-20 02:29:37] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2023-03-20 02:29:38] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 7106 ms
[2023-03-20 02:29:38] [INFO ] After 7888ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-20 02:29:38] [INFO ] After 8362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 61 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 1203/1203 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 1343 transition count 924
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 1064 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1063 transition count 923
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 560 place count 1063 transition count 765
Deduced a syphon composed of 158 places in 2 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 876 place count 905 transition count 765
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 1558 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1559 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 4 with 2 rules applied. Total rules applied 1561 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 4 with 116 rules applied. Total rules applied 1677 place count 505 transition count 422
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1678 place count 505 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1679 place count 504 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 1737 place count 504 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1738 place count 503 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1739 place count 502 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1739 place count 502 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1743 place count 500 transition count 418
Applied a total of 1743 rules in 143 ms. Remains 500 /1343 variables (removed 843) and now considering 418/1203 (removed 785) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 500/1343 places, 418/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished probabilistic random walk after 225741 steps, run visited all 2 properties in 2968 ms. (steps per millisecond=76 )
Probabilistic random walk after 225741 steps, saw 170910 distinct states, run finished after 2968 ms. (steps per millisecond=76 ) properties seen :2
Knowledge obtained : [(AND p2 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 9 factoid took 469 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Applied a total of 0 rules in 51 ms. Remains 1343 /1343 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2023-03-20 02:29:42] [INFO ] Invariant cache hit.
[2023-03-20 02:29:42] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-20 02:29:42] [INFO ] Invariant cache hit.
[2023-03-20 02:29:44] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
[2023-03-20 02:29:44] [INFO ] Invariant cache hit.
[2023-03-20 02:29:44] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2470 ms. Remains : 1343/1343 places, 1203/1203 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 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 366 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 129870 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129870 steps, saw 82629 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:29:48] [INFO ] Invariant cache hit.
[2023-03-20 02:29:48] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:29:49] [INFO ] [Nat]Absence check using 221 positive place invariants in 63 ms returned sat
[2023-03-20 02:29:50] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:29:50] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 1 ms to minimize.
[2023-03-20 02:29:50] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 0 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 26 places in 277 ms of which 1 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 1 ms to minimize.
[2023-03-20 02:29:51] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 1 ms to minimize.
[2023-03-20 02:29:52] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2023-03-20 02:29:52] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 1 ms to minimize.
[2023-03-20 02:29:52] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 1 ms to minimize.
[2023-03-20 02:29:52] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 0 ms to minimize.
[2023-03-20 02:29:53] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 1 ms to minimize.
[2023-03-20 02:29:53] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 1 ms to minimize.
[2023-03-20 02:29:53] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 1 ms to minimize.
[2023-03-20 02:29:54] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 0 ms to minimize.
[2023-03-20 02:29:54] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 1 ms to minimize.
[2023-03-20 02:29:54] [INFO ] Deduced a trap composed of 37 places in 273 ms of which 1 ms to minimize.
[2023-03-20 02:29:54] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 0 ms to minimize.
[2023-03-20 02:29:55] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 0 ms to minimize.
[2023-03-20 02:29:55] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2023-03-20 02:29:55] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 0 ms to minimize.
[2023-03-20 02:29:55] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 1 ms to minimize.
[2023-03-20 02:29:56] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 0 ms to minimize.
[2023-03-20 02:29:56] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 0 ms to minimize.
[2023-03-20 02:29:56] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 1 ms to minimize.
[2023-03-20 02:29:56] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2023-03-20 02:29:57] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 1 ms to minimize.
[2023-03-20 02:29:57] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 1 ms to minimize.
[2023-03-20 02:29:57] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 1 ms to minimize.
[2023-03-20 02:29:57] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 0 ms to minimize.
[2023-03-20 02:29:58] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2023-03-20 02:29:58] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 1 ms to minimize.
[2023-03-20 02:29:58] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 0 ms to minimize.
[2023-03-20 02:29:58] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 8403 ms
[2023-03-20 02:29:58] [INFO ] After 9595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 280 ms.
[2023-03-20 02:29:59] [INFO ] After 10330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 137 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 1203/1203 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 1343 transition count 924
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 1064 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1063 transition count 923
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 560 place count 1063 transition count 765
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 876 place count 905 transition count 765
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 1558 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1559 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 4 with 2 rules applied. Total rules applied 1561 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 4 with 116 rules applied. Total rules applied 1677 place count 505 transition count 422
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1678 place count 505 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1679 place count 504 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 1737 place count 504 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1738 place count 503 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1739 place count 502 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1739 place count 502 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1743 place count 500 transition count 418
Applied a total of 1743 rules in 142 ms. Remains 500 /1343 variables (removed 843) and now considering 418/1203 (removed 785) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 500/1343 places, 418/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 418 rows 500 cols
[2023-03-20 02:29:59] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-20 02:29:59] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:29:59] [INFO ] [Nat]Absence check using 220 positive place invariants in 25 ms returned sat
[2023-03-20 02:30:00] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:30:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:30:00] [INFO ] After 34ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 02:30:00] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2023-03-20 02:30:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-20 02:30:00] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-20 02:30:00] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 418/418 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 500/500 places, 418/418 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) 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 2) seen :0
Finished probabilistic random walk after 225741 steps, run visited all 2 properties in 2422 ms. (steps per millisecond=93 )
Probabilistic random walk after 225741 steps, saw 170910 distinct states, run finished after 2422 ms. (steps per millisecond=93 ) properties seen :2
Knowledge obtained : [(AND p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 9 factoid took 687 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 451 ms.
Product exploration explored 100000 steps with 0 reset in 523 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1343 transition count 1203
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 98 Pre rules applied. Total rules applied 280 place count 1343 transition count 1282
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 378 place count 1343 transition count 1282
Performed 382 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 760 places in 1 ms
Iterating global reduction 1 with 382 rules applied. Total rules applied 760 place count 1343 transition count 1283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 761 place count 1343 transition count 1282
Renaming transitions due to excessive name length > 1024 char.
Discarding 145 places :
Symmetric choice reduction at 2 with 145 rule applications. Total rules 906 place count 1198 transition count 1136
Deduced a syphon composed of 615 places in 1 ms
Iterating global reduction 2 with 145 rules applied. Total rules applied 1051 place count 1198 transition count 1136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1052 place count 1198 transition count 1136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1054 place count 1196 transition count 1134
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1056 place count 1196 transition count 1134
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -328
Deduced a syphon composed of 691 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1133 place count 1196 transition count 1462
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1210 place count 1119 transition count 1308
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1287 place count 1119 transition count 1308
Deduced a syphon composed of 614 places in 1 ms
Applied a total of 1287 rules in 584 ms. Remains 1119 /1343 variables (removed 224) and now considering 1308/1203 (removed -105) transitions.
[2023-03-20 02:30:06] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1308 rows 1119 cols
[2023-03-20 02:30:06] [INFO ] Computed 221 place invariants in 6 ms
[2023-03-20 02:30:06] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1119/1343 places, 1308/1203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1235 ms. Remains : 1119/1343 places, 1308/1203 transitions.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Applied a total of 0 rules in 40 ms. Remains 1343 /1343 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2023-03-20 02:30:07] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-20 02:30:07] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-20 02:30:07] [INFO ] Invariant cache hit.
[2023-03-20 02:30:08] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
[2023-03-20 02:30:08] [INFO ] Invariant cache hit.
[2023-03-20 02:30:09] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2355 ms. Remains : 1343/1343 places, 1203/1203 transitions.
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-10 finished in 44684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1064 transition count 766
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 906 transition count 766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 879 place count 903 transition count 763
Iterating global reduction 2 with 3 rules applied. Total rules applied 882 place count 903 transition count 763
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 882 place count 903 transition count 761
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 886 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 1 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1560 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 1561 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 1563 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 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1679 place count 505 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1681 place count 503 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1682 place count 502 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 1682 place count 502 transition count 418
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 1686 place count 500 transition count 418
Applied a total of 1686 rules in 165 ms. Remains 500 /1345 variables (removed 845) and now considering 418/1205 (removed 787) transitions.
// Phase 1: matrix 418 rows 500 cols
[2023-03-20 02:30:09] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-20 02:30:10] [INFO ] Implicit Places using invariants in 433 ms returned [483, 487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 435 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/1345 places, 418/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 496 transition count 416
Applied a total of 4 rules in 10 ms. Remains 496 /498 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 496 cols
[2023-03-20 02:30:10] [INFO ] Computed 218 place invariants in 5 ms
[2023-03-20 02:30:10] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-20 02:30:10] [INFO ] Invariant cache hit.
[2023-03-20 02:30:10] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 496/1345 places, 416/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1555 ms. Remains : 496/1345 places, 416/1205 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s277 0) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 448 ms.
Stack based approach found an accepted trace after 266 steps with 0 reset with depth 267 and stack size 267 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-11 finished in 2084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 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 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1064 transition count 766
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 906 transition count 766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 879 place count 903 transition count 763
Iterating global reduction 2 with 3 rules applied. Total rules applied 882 place count 903 transition count 763
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 882 place count 903 transition count 761
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 886 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 1560 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 1561 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 1563 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 1681 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 1683 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 1684 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 1684 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 1688 place count 499 transition count 418
Applied a total of 1688 rules in 101 ms. Remains 499 /1345 variables (removed 846) and now considering 418/1205 (removed 787) transitions.
// Phase 1: matrix 418 rows 499 cols
[2023-03-20 02:30:11] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-20 02:30:11] [INFO ] Implicit Places using invariants in 300 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 301 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/1345 places, 418/1205 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 10 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:30:11] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-20 02:30:12] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-20 02:30:12] [INFO ] Invariant cache hit.
[2023-03-20 02:30:12] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 495/1345 places, 416/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1227 ms. Remains : 495/1345 places, 416/1205 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s22 0) (NEQ s279 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 440 ms.
Stack based approach found an accepted trace after 187 steps with 0 reset with depth 188 and stack size 188 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-15 finished in 1739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((!p0 U ((p1 U p2)||F(p1)))) U p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((G(p2)||p1)))))'
[2023-03-20 02:30:13] [INFO ] Flatten gal took : 89 ms
[2023-03-20 02:30:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 02:30:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1345 places, 1205 transitions and 3130 arcs took 8 ms.
Total runtime 139949 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-020B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLCardinality

FORMULA ShieldPPPt-PT-020B-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679279514513

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 8 (type EXCL) for 3 ShieldPPPt-PT-020B-LTLCardinality-03
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for ShieldPPPt-PT-020B-LTLCardinality-03
lola: result : false
lola: markings : 1671
lola: fired transitions : 1943
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPt-PT-020B-LTLCardinality-02
lola: time limit : 1199 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLCardinality-03: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1199 6/32 ShieldPPPt-PT-020B-LTLCardinality-02 818439 m, 163687 m/sec, 1178223 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1199 12/32 ShieldPPPt-PT-020B-LTLCardinality-02 1680211 m, 172354 m/sec, 2470227 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1199 18/32 ShieldPPPt-PT-020B-LTLCardinality-02 2546623 m, 173282 m/sec, 3761650 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1199 23/32 ShieldPPPt-PT-020B-LTLCardinality-02 3416615 m, 173998 m/sec, 5061950 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 2 0 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1199 29/32 ShieldPPPt-PT-020B-LTLCardinality-02 4272744 m, 171225 m/sec, 6331525 t fired, .

Time elapsed: 26 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for ShieldPPPt-PT-020B-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLCardinality-03: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 2 0 0 2 0 0 0

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

Time elapsed: 31 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 15 (type EXCL) for 10 ShieldPPPt-PT-020B-LTLCardinality-10
lola: time limit : 1784 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLCardinality-03: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 5/1784 3/32 ShieldPPPt-PT-020B-LTLCardinality-10 270333 m, 54066 m/sec, 684579 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 10/1784 6/32 ShieldPPPt-PT-020B-LTLCardinality-10 489042 m, 43741 m/sec, 1379469 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 15/1784 8/32 ShieldPPPt-PT-020B-LTLCardinality-10 715952 m, 45382 m/sec, 2064380 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 20/1784 11/32 ShieldPPPt-PT-020B-LTLCardinality-10 935564 m, 43922 m/sec, 2757319 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 25/1784 13/32 ShieldPPPt-PT-020B-LTLCardinality-10 1146201 m, 42127 m/sec, 3445980 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 30/1784 15/32 ShieldPPPt-PT-020B-LTLCardinality-10 1383158 m, 47391 m/sec, 4131240 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 35/1784 18/32 ShieldPPPt-PT-020B-LTLCardinality-10 1589424 m, 41253 m/sec, 4821470 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 40/1784 19/32 ShieldPPPt-PT-020B-LTLCardinality-10 1755670 m, 33249 m/sec, 5522088 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 45/1784 21/32 ShieldPPPt-PT-020B-LTLCardinality-10 1925587 m, 33983 m/sec, 6212281 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 50/1784 24/32 ShieldPPPt-PT-020B-LTLCardinality-10 2131319 m, 41146 m/sec, 6900265 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-LTLCardinality-03: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 55/1784 25/32 ShieldPPPt-PT-020B-LTLCardinality-10 2296644 m, 33065 m/sec, 7598552 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-LTLCardinality-03: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 60/1784 28/32 ShieldPPPt-PT-020B-LTLCardinality-10 2519888 m, 44648 m/sec, 8273873 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-LTLCardinality-03: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 LTL EXCL 65/1784 30/32 ShieldPPPt-PT-020B-LTLCardinality-10 2764744 m, 48971 m/sec, 8951460 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ 0 1 0 0 2 0 1 0

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

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 13 (type EXCL) for 10 ShieldPPPt-PT-020B-LTLCardinality-10
lola: time limit : 3499 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for ShieldPPPt-PT-020B-LTLCardinality-10
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-020B-LTLCardinality-02: LTL unknown AGGR
ShieldPPPt-PT-020B-LTLCardinality-03: CONJ false LTL model checker
ShieldPPPt-PT-020B-LTLCardinality-10: CONJ unknown CONJ


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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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