About the Execution of ITS-Tools for ShieldRVt-PT-020B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3307.308 | 636414.00 | 2168034.00 | 418.10 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975000284.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975000284
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 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.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 239K 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 ShieldRVt-PT-020B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-020B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679171579274
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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 20:33:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:33:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:33:02] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-18 20:33:02] [INFO ] Transformed 1003 places.
[2023-03-18 20:33:02] [INFO ] Transformed 1003 transitions.
[2023-03-18 20:33:02] [INFO ] Found NUPN structural information;
[2023-03-18 20:33:02] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-020B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 203 places :
Symmetric choice reduction at 0 with 203 rule applications. Total rules 203 place count 800 transition count 800
Iterating global reduction 0 with 203 rules applied. Total rules applied 406 place count 800 transition count 800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 407 place count 799 transition count 799
Iterating global reduction 0 with 1 rules applied. Total rules applied 408 place count 799 transition count 799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 409 place count 798 transition count 798
Iterating global reduction 0 with 1 rules applied. Total rules applied 410 place count 798 transition count 798
Applied a total of 410 rules in 339 ms. Remains 798 /1003 variables (removed 205) and now considering 798/1003 (removed 205) transitions.
// Phase 1: matrix 798 rows 798 cols
[2023-03-18 20:33:02] [INFO ] Computed 81 place invariants in 34 ms
[2023-03-18 20:33:03] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-18 20:33:03] [INFO ] Invariant cache hit.
[2023-03-18 20:33:03] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
[2023-03-18 20:33:03] [INFO ] Invariant cache hit.
[2023-03-18 20:33:04] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 798/1003 places, 798/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1819 ms. Remains : 798/1003 places, 798/1003 transitions.
Support contains 35 out of 798 places after structural reductions.
[2023-03-18 20:33:04] [INFO ] Flatten gal took : 128 ms
[2023-03-18 20:33:04] [INFO ] Flatten gal took : 66 ms
[2023-03-18 20:33:04] [INFO ] Input system was already deterministic with 798 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=14 ) properties (out of 32) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-03-18 20:33:05] [INFO ] Invariant cache hit.
[2023-03-18 20:33:06] [INFO ] [Real]Absence check using 81 positive place invariants in 41 ms returned sat
[2023-03-18 20:33:07] [INFO ] After 1640ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-18 20:33:07] [INFO ] [Nat]Absence check using 81 positive place invariants in 73 ms returned sat
[2023-03-18 20:33:09] [INFO ] After 970ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-18 20:33:09] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 8 ms to minimize.
[2023-03-18 20:33:09] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
[2023-03-18 20:33:09] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 1 ms to minimize.
[2023-03-18 20:33:09] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 0 ms to minimize.
[2023-03-18 20:33:10] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-18 20:33:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1090 ms
[2023-03-18 20:33:10] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-18 20:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-18 20:33:10] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 1 ms to minimize.
[2023-03-18 20:33:11] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 0 ms to minimize.
[2023-03-18 20:33:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2023-03-18 20:33:11] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 1 ms to minimize.
[2023-03-18 20:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-18 20:33:11] [INFO ] After 3673ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 316 ms.
[2023-03-18 20:33:12] [INFO ] After 4567ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 227 ms.
Support contains 12 out of 798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 798/798 places, 798/798 transitions.
Drop transitions removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 215 place count 798 transition count 583
Reduce places removed 215 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 216 rules applied. Total rules applied 431 place count 583 transition count 582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 432 place count 582 transition count 582
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 432 place count 582 transition count 436
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 724 place count 436 transition count 436
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 732 place count 428 transition count 428
Iterating global reduction 3 with 8 rules applied. Total rules applied 740 place count 428 transition count 428
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 740 place count 428 transition count 422
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 752 place count 422 transition count 422
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 0 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 372 rules applied. Total rules applied 1124 place count 236 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1125 place count 236 transition count 235
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 1127 place count 235 transition count 234
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1237 place count 180 transition count 284
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1238 place count 180 transition count 283
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1239 place count 180 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1240 place count 179 transition count 282
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1241 place count 179 transition count 281
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1243 place count 179 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1244 place count 178 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1245 place count 177 transition count 280
Applied a total of 1245 rules in 228 ms. Remains 177 /798 variables (removed 621) and now considering 280/798 (removed 518) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 177/798 places, 280/798 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 280 rows 177 cols
[2023-03-18 20:33:12] [INFO ] Computed 80 place invariants in 1 ms
[2023-03-18 20:33:13] [INFO ] [Real]Absence check using 80 positive place invariants in 11 ms returned sat
[2023-03-18 20:33:13] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 20:33:13] [INFO ] [Nat]Absence check using 80 positive place invariants in 11 ms returned sat
[2023-03-18 20:33:13] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 20:33:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-18 20:33:13] [INFO ] After 47ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 20:33:13] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-18 20:33:13] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 13 ms.
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 280/280 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 177 transition count 278
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 175 transition count 278
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 175 transition count 275
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 172 transition count 275
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 170 transition count 273
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 166 transition count 278
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 166 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 164 transition count 276
Applied a total of 26 rules in 55 ms. Remains 164 /177 variables (removed 13) and now considering 276/280 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 164/177 places, 276/280 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 276 rows 164 cols
[2023-03-18 20:33:13] [INFO ] Computed 80 place invariants in 3 ms
[2023-03-18 20:33:14] [INFO ] [Real]Absence check using 80 positive place invariants in 24 ms returned sat
[2023-03-18 20:33:14] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:33:14] [INFO ] [Nat]Absence check using 80 positive place invariants in 9 ms returned sat
[2023-03-18 20:33:14] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:33:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-18 20:33:14] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 20:33:14] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-18 20:33:14] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 276/276 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 164 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 163 transition count 275
Applied a total of 2 rules in 9 ms. Remains 163 /164 variables (removed 1) and now considering 275/276 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 163/164 places, 275/276 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 275 rows 163 cols
[2023-03-18 20:33:14] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-18 20:33:14] [INFO ] [Real]Absence check using 80 positive place invariants in 12 ms returned sat
[2023-03-18 20:33:14] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:33:14] [INFO ] [Nat]Absence check using 80 positive place invariants in 13 ms returned sat
[2023-03-18 20:33:14] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:33:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-18 20:33:14] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 20:33:14] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-18 20:33:14] [INFO ] After 221ms 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 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 275/275 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 274
Applied a total of 2 rules in 9 ms. Remains 162 /163 variables (removed 1) and now considering 274/275 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 162/163 places, 274/275 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 88737 steps, run visited all 1 properties in 430 ms. (steps per millisecond=206 )
Probabilistic random walk after 88737 steps, saw 59022 distinct states, run finished after 430 ms. (steps per millisecond=206 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 241 stabilizing places and 241 stable transitions
FORMULA ShieldRVt-PT-020B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))||G(p2)))))'
Support contains 4 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 784 transition count 784
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 784 transition count 784
Applied a total of 28 rules in 55 ms. Remains 784 /798 variables (removed 14) and now considering 784/798 (removed 14) transitions.
// Phase 1: matrix 784 rows 784 cols
[2023-03-18 20:33:15] [INFO ] Computed 81 place invariants in 6 ms
[2023-03-18 20:33:16] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-18 20:33:16] [INFO ] Invariant cache hit.
[2023-03-18 20:33:16] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2023-03-18 20:33:16] [INFO ] Invariant cache hit.
[2023-03-18 20:33:17] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 784/798 places, 784/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1358 ms. Remains : 784/798 places, 784/798 transitions.
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s543 0) (EQ s127 1)), p2:(EQ s160 1), p1:(AND (EQ s68 1) (EQ s543 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-00 finished in 1900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 797 transition count 575
Reduce places removed 222 places and 0 transitions.
Iterating post reduction 1 with 222 rules applied. Total rules applied 444 place count 575 transition count 575
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 444 place count 575 transition count 426
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 742 place count 426 transition count 426
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 755 place count 413 transition count 413
Iterating global reduction 2 with 13 rules applied. Total rules applied 768 place count 413 transition count 413
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 768 place count 413 transition count 403
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 788 place count 403 transition count 403
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1146 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1147 place count 224 transition count 223
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 1149 place count 223 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
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 1267 place count 164 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1269 place count 162 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1270 place count 161 transition count 278
Applied a total of 1270 rules in 93 ms. Remains 161 /798 variables (removed 637) and now considering 278/798 (removed 520) transitions.
// Phase 1: matrix 278 rows 161 cols
[2023-03-18 20:33:17] [INFO ] Computed 80 place invariants in 1 ms
[2023-03-18 20:33:17] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-18 20:33:17] [INFO ] Invariant cache hit.
[2023-03-18 20:33:18] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-18 20:33:18] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 20:33:18] [INFO ] Invariant cache hit.
[2023-03-18 20:33:18] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/798 places, 278/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 628 ms. Remains : 161/798 places, 278/798 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s104 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-01 finished in 668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 781 transition count 781
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 781 transition count 781
Applied a total of 34 rules in 54 ms. Remains 781 /798 variables (removed 17) and now considering 781/798 (removed 17) transitions.
// Phase 1: matrix 781 rows 781 cols
[2023-03-18 20:33:18] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-18 20:33:18] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-18 20:33:18] [INFO ] Invariant cache hit.
[2023-03-18 20:33:19] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-03-18 20:33:19] [INFO ] Invariant cache hit.
[2023-03-18 20:33:19] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 781/798 places, 781/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1333 ms. Remains : 781/798 places, 781/798 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-02 finished in 1508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&(X(!p1) U ((X(!p1)&&G((p2&&X(p2))))||X(G(!p1))))))))'
Support contains 4 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 781 transition count 781
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 781 transition count 781
Applied a total of 34 rules in 43 ms. Remains 781 /798 variables (removed 17) and now considering 781/798 (removed 17) transitions.
[2023-03-18 20:33:19] [INFO ] Invariant cache hit.
[2023-03-18 20:33:20] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-18 20:33:20] [INFO ] Invariant cache hit.
[2023-03-18 20:33:20] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-18 20:33:20] [INFO ] Invariant cache hit.
[2023-03-18 20:33:21] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 781/798 places, 781/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1238 ms. Remains : 781/798 places, 781/798 transitions.
Stuttering acceptance computed with spot in 404 ms :[true, (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (NOT p2), p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 7}, { cond=(AND p2 p0), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 7}, { cond=(AND p2 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 7}, { cond=(AND p2 p0 p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(NEQ s330 1), p2:(NEQ s564 1), p1:(OR (EQ s723 1) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4329 steps with 0 reset in 53 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-03 finished in 1743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(((p1||F(p2)||X(X(F(p3)))) U p2))||p0)))'
Support contains 2 out of 798 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 782 transition count 782
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 782 transition count 782
Applied a total of 32 rules in 44 ms. Remains 782 /798 variables (removed 16) and now considering 782/798 (removed 16) transitions.
// Phase 1: matrix 782 rows 782 cols
[2023-03-18 20:33:21] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-18 20:33:21] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-18 20:33:22] [INFO ] Invariant cache hit.
[2023-03-18 20:33:22] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
[2023-03-18 20:33:22] [INFO ] Invariant cache hit.
[2023-03-18 20:33:23] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 782/798 places, 782/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1537 ms. Remains : 782/798 places, 782/798 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s436 1) (EQ s217 1)), p2:(EQ s436 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 398 reset in 358 ms.
Product exploration explored 100000 steps with 396 reset in 399 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 246 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-18 20:33:24] [INFO ] Invariant cache hit.
[2023-03-18 20:33:24] [INFO ] [Real]Absence check using 81 positive place invariants in 42 ms returned sat
[2023-03-18 20:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:33:25] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2023-03-18 20:33:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:33:26] [INFO ] [Nat]Absence check using 81 positive place invariants in 47 ms returned sat
[2023-03-18 20:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:33:27] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2023-03-18 20:33:27] [INFO ] Computed and/alt/rep : 781/1143/781 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-18 20:33:39] [INFO ] Added : 781 causal constraints over 157 iterations in 12199 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 782 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 782/782 places, 782/782 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 781 transition count 565
Reduce places removed 216 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 218 rules applied. Total rules applied 434 place count 565 transition count 563
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 563 transition count 563
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 436 place count 563 transition count 405
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 752 place count 405 transition count 405
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 5 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 1106 place count 228 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1107 place count 228 transition count 227
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 1109 place count 227 transition count 226
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 5 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1225 place count 169 transition count 282
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1227 place count 167 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1228 place count 166 transition count 280
Applied a total of 1228 rules in 124 ms. Remains 166 /782 variables (removed 616) and now considering 280/782 (removed 502) transitions.
// Phase 1: matrix 280 rows 166 cols
[2023-03-18 20:33:39] [INFO ] Computed 80 place invariants in 1 ms
[2023-03-18 20:33:39] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-18 20:33:39] [INFO ] Invariant cache hit.
[2023-03-18 20:33:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 20:33:39] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2023-03-18 20:33:39] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 20:33:39] [INFO ] Invariant cache hit.
[2023-03-18 20:33:40] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/782 places, 280/782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 883 ms. Remains : 166/782 places, 280/782 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-18 20:33:40] [INFO ] Invariant cache hit.
[2023-03-18 20:33:40] [INFO ] [Real]Absence check using 80 positive place invariants in 16 ms returned sat
[2023-03-18 20:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:33:40] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-18 20:33:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:33:40] [INFO ] [Nat]Absence check using 80 positive place invariants in 16 ms returned sat
[2023-03-18 20:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:33:41] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-18 20:33:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 20:33:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-03-18 20:33:41] [INFO ] Computed and/alt/rep : 275/867/275 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-18 20:33:41] [INFO ] Added : 220 causal constraints over 45 iterations in 775 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-04 finished in 20206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((p1||X(X(!p0)))))))'
Support contains 2 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 781 transition count 781
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 781 transition count 781
Applied a total of 34 rules in 27 ms. Remains 781 /798 variables (removed 17) and now considering 781/798 (removed 17) transitions.
// Phase 1: matrix 781 rows 781 cols
[2023-03-18 20:33:41] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-18 20:33:42] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-18 20:33:42] [INFO ] Invariant cache hit.
[2023-03-18 20:33:42] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2023-03-18 20:33:42] [INFO ] Invariant cache hit.
[2023-03-18 20:33:43] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 781/798 places, 781/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1293 ms. Remains : 781/798 places, 781/798 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s420 1), p1:(EQ s267 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20014 reset in 386 ms.
Product exploration explored 100000 steps with 20045 reset in 401 ms.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 363 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:33:45] [INFO ] Invariant cache hit.
[2023-03-18 20:33:45] [INFO ] [Real]Absence check using 81 positive place invariants in 42 ms returned sat
[2023-03-18 20:33:45] [INFO ] After 313ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 20:33:45] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 1 ms to minimize.
[2023-03-18 20:33:46] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 0 ms to minimize.
[2023-03-18 20:33:46] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 0 ms to minimize.
[2023-03-18 20:33:46] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 1 ms to minimize.
[2023-03-18 20:33:46] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2023-03-18 20:33:46] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 1 ms to minimize.
[2023-03-18 20:33:47] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2023-03-18 20:33:47] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 0 ms to minimize.
[2023-03-18 20:33:47] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2023-03-18 20:33:47] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2023-03-18 20:33:47] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2023-03-18 20:33:47] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2023-03-18 20:33:47] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2023-03-18 20:33:48] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 0 ms to minimize.
[2023-03-18 20:33:48] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2498 ms
[2023-03-18 20:33:48] [INFO ] After 2835ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:33:48] [INFO ] After 3122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:33:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2023-03-18 20:33:48] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:33:48] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 1 ms to minimize.
[2023-03-18 20:33:49] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 0 ms to minimize.
[2023-03-18 20:33:49] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2023-03-18 20:33:49] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 0 ms to minimize.
[2023-03-18 20:33:49] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 0 ms to minimize.
[2023-03-18 20:33:49] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 0 ms to minimize.
[2023-03-18 20:33:50] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 2 ms to minimize.
[2023-03-18 20:33:50] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 12 ms to minimize.
[2023-03-18 20:33:50] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 1 ms to minimize.
[2023-03-18 20:33:50] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2023-03-18 20:33:50] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2023-03-18 20:33:50] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 0 ms to minimize.
[2023-03-18 20:33:51] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 1 ms to minimize.
[2023-03-18 20:33:51] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2023-03-18 20:33:51] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2023-03-18 20:33:51] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2023-03-18 20:33:51] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3026 ms
[2023-03-18 20:33:51] [INFO ] After 3354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-18 20:33:51] [INFO ] After 3544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 781/781 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 781 transition count 563
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 563 transition count 563
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 436 place count 563 transition count 403
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 756 place count 403 transition count 403
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1114 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1115 place count 224 transition count 223
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 1117 place count 223 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
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 1235 place count 164 transition count 280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1236 place count 164 transition count 279
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1237 place count 164 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1238 place count 163 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1239 place count 162 transition count 278
Applied a total of 1239 rules in 47 ms. Remains 162 /781 variables (removed 619) and now considering 278/781 (removed 503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 162/781 places, 278/781 transitions.
Finished random walk after 1332 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=222 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 5 factoid took 424 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 280 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Support contains 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 781/781 transitions.
Applied a total of 0 rules in 23 ms. Remains 781 /781 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-18 20:33:52] [INFO ] Invariant cache hit.
[2023-03-18 20:33:53] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-18 20:33:53] [INFO ] Invariant cache hit.
[2023-03-18 20:33:53] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2023-03-18 20:33:53] [INFO ] Invariant cache hit.
[2023-03-18 20:33:54] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1474 ms. Remains : 781/781 places, 781/781 transitions.
Computed a total of 238 stabilizing places and 238 stable transitions
Computed a total of 238 stabilizing places and 238 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 314 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:33:55] [INFO ] Invariant cache hit.
[2023-03-18 20:33:55] [INFO ] [Real]Absence check using 81 positive place invariants in 24 ms returned sat
[2023-03-18 20:33:55] [INFO ] After 303ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 20:33:55] [INFO ] Deduced a trap composed of 36 places in 277 ms of which 2 ms to minimize.
[2023-03-18 20:33:56] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 1 ms to minimize.
[2023-03-18 20:33:56] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 1 ms to minimize.
[2023-03-18 20:33:56] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 1 ms to minimize.
[2023-03-18 20:33:56] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:33:56] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 1 ms to minimize.
[2023-03-18 20:33:57] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 0 ms to minimize.
[2023-03-18 20:33:57] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 1 ms to minimize.
[2023-03-18 20:33:57] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 1 ms to minimize.
[2023-03-18 20:33:57] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 1 ms to minimize.
[2023-03-18 20:33:57] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2023-03-18 20:33:57] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2023-03-18 20:33:58] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2023-03-18 20:33:58] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2023-03-18 20:33:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2651 ms
[2023-03-18 20:33:58] [INFO ] After 2976ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:33:58] [INFO ] After 3149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:33:58] [INFO ] [Nat]Absence check using 81 positive place invariants in 22 ms returned sat
[2023-03-18 20:33:58] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:33:58] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 1 ms to minimize.
[2023-03-18 20:33:59] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 0 ms to minimize.
[2023-03-18 20:33:59] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 0 ms to minimize.
[2023-03-18 20:33:59] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 1 ms to minimize.
[2023-03-18 20:33:59] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 1 ms to minimize.
[2023-03-18 20:33:59] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 0 ms to minimize.
[2023-03-18 20:34:00] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2023-03-18 20:34:00] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2023-03-18 20:34:00] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 0 ms to minimize.
[2023-03-18 20:34:00] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2023-03-18 20:34:00] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 7 ms to minimize.
[2023-03-18 20:34:00] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2023-03-18 20:34:00] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 1 ms to minimize.
[2023-03-18 20:34:01] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2023-03-18 20:34:01] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2023-03-18 20:34:01] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2023-03-18 20:34:01] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2650 ms
[2023-03-18 20:34:01] [INFO ] After 2986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-18 20:34:01] [INFO ] After 3173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 781/781 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 781 transition count 563
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 436 place count 563 transition count 563
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 436 place count 563 transition count 403
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 756 place count 403 transition count 403
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1114 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1115 place count 224 transition count 223
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 1117 place count 223 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -58
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 1235 place count 164 transition count 280
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1236 place count 164 transition count 279
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1237 place count 164 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1238 place count 163 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1239 place count 162 transition count 278
Applied a total of 1239 rules in 105 ms. Remains 162 /781 variables (removed 619) and now considering 278/781 (removed 503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 162/781 places, 278/781 transitions.
Finished random walk after 903 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=180 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 5 factoid took 341 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 252 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 306 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 19939 reset in 429 ms.
Product exploration explored 100000 steps with 19962 reset in 440 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 229 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1))]
Support contains 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 781/781 transitions.
Performed 218 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 781 transition count 781
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 79 Pre rules applied. Total rules applied 218 place count 781 transition count 860
Deduced a syphon composed of 297 places in 1 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 297 place count 781 transition count 860
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 537 places in 1 ms
Iterating global reduction 1 with 240 rules applied. Total rules applied 537 place count 781 transition count 860
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 538 place count 781 transition count 859
Renaming transitions due to excessive name length > 1024 char.
Discarding 160 places :
Symmetric choice reduction at 2 with 160 rule applications. Total rules 698 place count 621 transition count 699
Deduced a syphon composed of 377 places in 1 ms
Iterating global reduction 2 with 160 rules applied. Total rules applied 858 place count 621 transition count 699
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 859 place count 621 transition count 699
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 861 place count 619 transition count 697
Deduced a syphon composed of 376 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 863 place count 619 transition count 697
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -563
Deduced a syphon composed of 453 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 940 place count 619 transition count 1260
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1017 place count 542 transition count 1106
Deduced a syphon composed of 376 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1094 place count 542 transition count 1106
Deduced a syphon composed of 376 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1097 place count 542 transition count 1103
Deduced a syphon composed of 376 places in 0 ms
Applied a total of 1097 rules in 276 ms. Remains 542 /781 variables (removed 239) and now considering 1103/781 (removed -322) transitions.
[2023-03-18 20:34:04] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 1103 rows 542 cols
[2023-03-18 20:34:04] [INFO ] Computed 81 place invariants in 8 ms
[2023-03-18 20:34:04] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 542/781 places, 1103/781 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 848 ms. Remains : 542/781 places, 1103/781 transitions.
Built C files in :
/tmp/ltsmin16374329913812135644
[2023-03-18 20:34:05] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16374329913812135644
Running compilation step : cd /tmp/ltsmin16374329913812135644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1269 ms.
Running link step : cd /tmp/ltsmin16374329913812135644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 106 ms.
Running LTSmin : cd /tmp/ltsmin16374329913812135644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2150959951191033184.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 781/781 transitions.
Applied a total of 0 rules in 32 ms. Remains 781 /781 variables (removed 0) and now considering 781/781 (removed 0) transitions.
// Phase 1: matrix 781 rows 781 cols
[2023-03-18 20:34:20] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-18 20:34:20] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-18 20:34:20] [INFO ] Invariant cache hit.
[2023-03-18 20:34:21] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-18 20:34:21] [INFO ] Invariant cache hit.
[2023-03-18 20:34:21] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1199 ms. Remains : 781/781 places, 781/781 transitions.
Built C files in :
/tmp/ltsmin1673329311578183250
[2023-03-18 20:34:21] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1673329311578183250
Running compilation step : cd /tmp/ltsmin1673329311578183250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1101 ms.
Running link step : cd /tmp/ltsmin1673329311578183250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1673329311578183250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17162935946851736394.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:34:36] [INFO ] Flatten gal took : 41 ms
[2023-03-18 20:34:36] [INFO ] Flatten gal took : 33 ms
[2023-03-18 20:34:36] [INFO ] Time to serialize gal into /tmp/LTL11782779905231697157.gal : 8 ms
[2023-03-18 20:34:36] [INFO ] Time to serialize properties into /tmp/LTL16589752536623184207.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11782779905231697157.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10374843749779121615.hoa' '-atoms' '/tmp/LTL16589752536623184207.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16589752536623184207.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10374843749779121615.hoa
Detected timeout of ITS tools.
[2023-03-18 20:34:51] [INFO ] Flatten gal took : 74 ms
[2023-03-18 20:34:52] [INFO ] Flatten gal took : 58 ms
[2023-03-18 20:34:52] [INFO ] Time to serialize gal into /tmp/LTL5876606816643097924.gal : 5 ms
[2023-03-18 20:34:52] [INFO ] Time to serialize properties into /tmp/LTL5711527142500366857.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5876606816643097924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5711527142500366857.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(p534==1)")U(X(("(p337==1)")||(X(X("(p534!=1)"))))))))
Formula 0 simplified : F(!"(p534==1)" R X(!"(p337==1)" & XX!"(p534!=1)"))
Detected timeout of ITS tools.
[2023-03-18 20:35:07] [INFO ] Flatten gal took : 53 ms
[2023-03-18 20:35:07] [INFO ] Applying decomposition
[2023-03-18 20:35:07] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10829347112573903470.txt' '-o' '/tmp/graph10829347112573903470.bin' '-w' '/tmp/graph10829347112573903470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10829347112573903470.bin' '-l' '-1' '-v' '-w' '/tmp/graph10829347112573903470.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:35:07] [INFO ] Decomposing Gal with order
[2023-03-18 20:35:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:35:07] [INFO ] Removed a total of 201 redundant transitions.
[2023-03-18 20:35:08] [INFO ] Flatten gal took : 438 ms
[2023-03-18 20:35:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2023-03-18 20:35:08] [INFO ] Time to serialize gal into /tmp/LTL6028573247635186608.gal : 41 ms
[2023-03-18 20:35:08] [INFO ] Time to serialize properties into /tmp/LTL4054336107588237724.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6028573247635186608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4054336107588237724.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(i11.i2.u168.p534==1)")U(X(("(i8.i2.u106.p337==1)")||(X(X("(i11.i2.u168.p534!=1)"))))))))
Formula 0 simplified : F(!"(i11.i2.u168.p534==1)" R X(!"(i8.i2.u106.p337==1)" & XX!"(i11.i2.u168.p534!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1662682618566953808
[2023-03-18 20:35:23] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1662682618566953808
Running compilation step : cd /tmp/ltsmin1662682618566953808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1489 ms.
Running link step : cd /tmp/ltsmin1662682618566953808;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1662682618566953808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U X(((LTLAPp1==true)||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-020B-LTLFireability-05 finished in 116852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(G(p1))))))'
Support contains 2 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 782 transition count 782
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 782 transition count 782
Applied a total of 32 rules in 67 ms. Remains 782 /798 variables (removed 16) and now considering 782/798 (removed 16) transitions.
// Phase 1: matrix 782 rows 782 cols
[2023-03-18 20:35:38] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-18 20:35:45] [INFO ] Implicit Places using invariants in 6331 ms returned []
[2023-03-18 20:35:45] [INFO ] Invariant cache hit.
[2023-03-18 20:35:45] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 7051 ms to find 0 implicit places.
[2023-03-18 20:35:45] [INFO ] Invariant cache hit.
[2023-03-18 20:35:46] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 782/798 places, 782/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7723 ms. Remains : 782/798 places, 782/798 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s258 1), p1:(EQ s477 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20733 steps with 0 reset in 77 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-06 finished in 8069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 797 transition count 576
Reduce places removed 221 places and 0 transitions.
Iterating post reduction 1 with 221 rules applied. Total rules applied 442 place count 576 transition count 576
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 442 place count 576 transition count 428
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 738 place count 428 transition count 428
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 752 place count 414 transition count 414
Iterating global reduction 2 with 14 rules applied. Total rules applied 766 place count 414 transition count 414
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 766 place count 414 transition count 403
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 788 place count 403 transition count 403
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1146 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1147 place count 224 transition count 223
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 1149 place count 223 transition count 222
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1265 place count 165 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1267 place count 163 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1268 place count 162 transition count 276
Applied a total of 1268 rules in 78 ms. Remains 162 /798 variables (removed 636) and now considering 276/798 (removed 522) transitions.
// Phase 1: matrix 276 rows 162 cols
[2023-03-18 20:35:46] [INFO ] Computed 80 place invariants in 1 ms
[2023-03-18 20:35:53] [INFO ] Implicit Places using invariants in 6932 ms returned []
[2023-03-18 20:35:53] [INFO ] Invariant cache hit.
[2023-03-18 20:35:54] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 7179 ms to find 0 implicit places.
[2023-03-18 20:35:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 20:35:54] [INFO ] Invariant cache hit.
[2023-03-18 20:35:54] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/798 places, 276/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7491 ms. Remains : 162/798 places, 276/798 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s21 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-07 finished in 7648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&F(p1)&&F(p2))))))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 783 transition count 783
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 783 transition count 783
Applied a total of 30 rules in 23 ms. Remains 783 /798 variables (removed 15) and now considering 783/798 (removed 15) transitions.
// Phase 1: matrix 783 rows 783 cols
[2023-03-18 20:35:54] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-18 20:35:54] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-18 20:35:54] [INFO ] Invariant cache hit.
[2023-03-18 20:35:55] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2023-03-18 20:35:55] [INFO ] Invariant cache hit.
[2023-03-18 20:35:55] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 783/798 places, 783/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1374 ms. Remains : 783/798 places, 783/798 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s284 1), p1:(EQ s99 1), p2:(EQ s177 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25750 steps with 2 reset in 64 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-08 finished in 1904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 2 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 797 transition count 575
Reduce places removed 222 places and 0 transitions.
Iterating post reduction 1 with 222 rules applied. Total rules applied 444 place count 575 transition count 575
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 444 place count 575 transition count 426
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 742 place count 426 transition count 426
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 754 place count 414 transition count 414
Iterating global reduction 2 with 12 rules applied. Total rules applied 766 place count 414 transition count 414
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 766 place count 414 transition count 405
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 784 place count 405 transition count 405
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1144 place count 225 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1145 place count 225 transition count 224
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 1147 place count 224 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -57
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 1265 place count 165 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1267 place count 163 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1268 place count 162 transition count 278
Applied a total of 1268 rules in 91 ms. Remains 162 /798 variables (removed 636) and now considering 278/798 (removed 520) transitions.
// Phase 1: matrix 278 rows 162 cols
[2023-03-18 20:35:56] [INFO ] Computed 80 place invariants in 0 ms
[2023-03-18 20:35:56] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-18 20:35:56] [INFO ] Invariant cache hit.
[2023-03-18 20:35:57] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-18 20:35:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:35:57] [INFO ] Invariant cache hit.
[2023-03-18 20:35:57] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/798 places, 278/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1138 ms. Remains : 162/798 places, 278/798 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s6 1), p0:(EQ s151 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-09 finished in 1264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((G(p1)||(p2&&F(G(p0))))))))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 797 transition count 577
Reduce places removed 220 places and 0 transitions.
Iterating post reduction 1 with 220 rules applied. Total rules applied 440 place count 577 transition count 577
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 440 place count 577 transition count 428
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 738 place count 428 transition count 428
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 750 place count 416 transition count 416
Iterating global reduction 2 with 12 rules applied. Total rules applied 762 place count 416 transition count 416
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 762 place count 416 transition count 407
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 780 place count 407 transition count 407
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 1138 place count 228 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1139 place count 228 transition count 227
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 1141 place count 227 transition count 226
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -57
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 1259 place count 168 transition count 283
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1260 place count 168 transition count 283
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1262 place count 166 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1263 place count 165 transition count 281
Applied a total of 1263 rules in 65 ms. Remains 165 /798 variables (removed 633) and now considering 281/798 (removed 517) transitions.
// Phase 1: matrix 281 rows 165 cols
[2023-03-18 20:35:57] [INFO ] Computed 80 place invariants in 1 ms
[2023-03-18 20:35:57] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-18 20:35:57] [INFO ] Invariant cache hit.
[2023-03-18 20:35:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 20:35:58] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-18 20:35:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:35:58] [INFO ] Invariant cache hit.
[2023-03-18 20:35:58] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/798 places, 281/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 672 ms. Remains : 165/798 places, 281/798 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s100 1), p0:(EQ s67 1), p1:(EQ s121 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-10 finished in 948 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(G(p1)))))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 219 place count 797 transition count 578
Reduce places removed 219 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 220 rules applied. Total rules applied 439 place count 578 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 440 place count 577 transition count 577
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 440 place count 577 transition count 429
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 736 place count 429 transition count 429
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 749 place count 416 transition count 416
Iterating global reduction 3 with 13 rules applied. Total rules applied 762 place count 416 transition count 416
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 762 place count 416 transition count 405
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 784 place count 405 transition count 405
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1142 place count 226 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1143 place count 226 transition count 225
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 1145 place count 225 transition count 224
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -54
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 1259 place count 168 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1261 place count 166 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1262 place count 165 transition count 276
Applied a total of 1262 rules in 78 ms. Remains 165 /798 variables (removed 633) and now considering 276/798 (removed 522) transitions.
// Phase 1: matrix 276 rows 165 cols
[2023-03-18 20:35:58] [INFO ] Computed 80 place invariants in 1 ms
[2023-03-18 20:35:58] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-18 20:35:58] [INFO ] Invariant cache hit.
[2023-03-18 20:35:59] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-18 20:35:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:35:59] [INFO ] Invariant cache hit.
[2023-03-18 20:35:59] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/798 places, 276/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 622 ms. Remains : 165/798 places, 276/798 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-11 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s78 0) (EQ s37 1)), p1:(EQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-11 finished in 781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 797 transition count 576
Reduce places removed 221 places and 0 transitions.
Iterating post reduction 1 with 221 rules applied. Total rules applied 442 place count 576 transition count 576
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 442 place count 576 transition count 427
Deduced a syphon composed of 149 places in 3 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 740 place count 427 transition count 427
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 754 place count 413 transition count 413
Iterating global reduction 2 with 14 rules applied. Total rules applied 768 place count 413 transition count 413
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 768 place count 413 transition count 402
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 790 place count 402 transition count 402
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 1146 place count 224 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1147 place count 224 transition count 223
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 1149 place count 223 transition count 222
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1265 place count 165 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1267 place count 163 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1268 place count 162 transition count 276
Applied a total of 1268 rules in 61 ms. Remains 162 /798 variables (removed 636) and now considering 276/798 (removed 522) transitions.
// Phase 1: matrix 276 rows 162 cols
[2023-03-18 20:35:59] [INFO ] Computed 80 place invariants in 0 ms
[2023-03-18 20:35:59] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-18 20:35:59] [INFO ] Invariant cache hit.
[2023-03-18 20:35:59] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-18 20:35:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:35:59] [INFO ] Invariant cache hit.
[2023-03-18 20:35:59] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/798 places, 276/798 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 620 ms. Remains : 162/798 places, 276/798 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 621 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-12 finished in 683 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||X(X(G(p1)))||F(p2))))'
Support contains 3 out of 798 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 798/798 places, 798/798 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 783 transition count 783
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 783 transition count 783
Applied a total of 30 rules in 23 ms. Remains 783 /798 variables (removed 15) and now considering 783/798 (removed 15) transitions.
// Phase 1: matrix 783 rows 783 cols
[2023-03-18 20:36:00] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-18 20:36:00] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-18 20:36:00] [INFO ] Invariant cache hit.
[2023-03-18 20:36:00] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2023-03-18 20:36:00] [INFO ] Invariant cache hit.
[2023-03-18 20:36:01] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 783/798 places, 783/798 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1368 ms. Remains : 783/798 places, 783/798 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s741 1), p0:(EQ s502 1), p1:(EQ s381 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 278 reset in 308 ms.
Stack based approach found an accepted trace after 1151 steps with 3 reset with depth 412 and stack size 412 in 3 ms.
FORMULA ShieldRVt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020B-LTLFireability-14 finished in 1924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((p1||X(X(!p0)))))))'
[2023-03-18 20:36:02] [INFO ] Flatten gal took : 64 ms
Using solver Z3 to compute partial order matrices.
[2023-03-18 20:36:02] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin15342990114416145806
[2023-03-18 20:36:02] [INFO ] Computing symmetric may disable matrix : 798 transitions.
[2023-03-18 20:36:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:36:02] [INFO ] Computing symmetric may enable matrix : 798 transitions.
[2023-03-18 20:36:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:36:02] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1768643863275408483.txt' '-o' '/tmp/graph1768643863275408483.bin' '-w' '/tmp/graph1768643863275408483.weights'
[2023-03-18 20:36:02] [INFO ] Computing Do-Not-Accords matrix : 798 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1768643863275408483.bin' '-l' '-1' '-v' '-w' '/tmp/graph1768643863275408483.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:36:02] [INFO ] Decomposing Gal with order
[2023-03-18 20:36:02] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:36:02] [INFO ] Built C files in 301ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15342990114416145806
Running compilation step : cd /tmp/ltsmin15342990114416145806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 20:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:36:02] [INFO ] Removed a total of 191 redundant transitions.
[2023-03-18 20:36:02] [INFO ] Flatten gal took : 73 ms
[2023-03-18 20:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2023-03-18 20:36:02] [INFO ] Time to serialize gal into /tmp/LTLFireability9273772212286711600.gal : 18 ms
[2023-03-18 20:36:02] [INFO ] Time to serialize properties into /tmp/LTLFireability5799214800407945300.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9273772212286711600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5799214800407945300.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(i11.i2.u176.p534==1)")U(X(("(i7.i2.u115.p337==1)")||(X(X("(i11.i2.u176.p534!=1)"))))))))
Formula 0 simplified : F(!"(i11.i2.u176.p534==1)" R X(!"(i7.i2.u115.p337==1)" & XX!"(i11.i2.u176.p534!=1)"))
Compilation finished in 3296 ms.
Running link step : cd /tmp/ltsmin15342990114416145806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin15342990114416145806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U X(((LTLAPp1==true)||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t719, t721, t723, t727, t729, t731, t733, t738, t740, t742, t746, t748, t750, t752, t754, t75...2938
Computing Next relation with stutter on 1.10526e+15 deadlock states
325 unique states visited
325 strongly connected components in search stack
326 transitions explored
325 items max in DFS search stack
18803 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,188.202,1249872,1,0,2.22988e+06,1389,8135,5.93571e+06,255,4635,1611958
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020B-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 633307 ms.
BK_STOP 1679172215688
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="ShieldRVt-PT-020B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVt-PT-020B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-tajo-167905975000284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;