About the Execution of LoLa+red for ShieldPPPt-PT-003B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1934.464 | 50747.00 | 92376.00 | 57.70 | FTTFFFFFFFTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715400572.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldPPPt-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400572
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 21:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:06 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.9K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 21:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 56K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679278527979
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-003B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:15:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:15:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:15:31] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-20 02:15:31] [INFO ] Transformed 237 places.
[2023-03-20 02:15:31] [INFO ] Transformed 216 transitions.
[2023-03-20 02:15:31] [INFO ] Found NUPN structural information;
[2023-03-20 02:15:31] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-003B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 216/216 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 211 transition count 190
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 211 transition count 190
Applied a total of 52 rules in 89 ms. Remains 211 /237 variables (removed 26) and now considering 190/216 (removed 26) transitions.
// Phase 1: matrix 190 rows 211 cols
[2023-03-20 02:15:32] [INFO ] Computed 34 place invariants in 13 ms
[2023-03-20 02:15:33] [INFO ] Implicit Places using invariants in 1510 ms returned []
[2023-03-20 02:15:33] [INFO ] Invariant cache hit.
[2023-03-20 02:15:35] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 2856 ms to find 0 implicit places.
[2023-03-20 02:15:35] [INFO ] Invariant cache hit.
[2023-03-20 02:15:36] [INFO ] Dead Transitions using invariants and state equation in 1555 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 211/237 places, 190/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4526 ms. Remains : 211/237 places, 190/216 transitions.
Support contains 34 out of 211 places after structural reductions.
[2023-03-20 02:15:37] [INFO ] Flatten gal took : 55 ms
[2023-03-20 02:15:37] [INFO ] Flatten gal took : 18 ms
[2023-03-20 02:15:37] [INFO ] Input system was already deterministic with 190 transitions.
Support contains 32 out of 211 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:15:37] [INFO ] Invariant cache hit.
[2023-03-20 02:15:37] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2023-03-20 02:15:38] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:15:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 60 ms returned sat
[2023-03-20 02:15:38] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:15:38] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 3 ms to minimize.
[2023-03-20 02:15:38] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 1 ms to minimize.
[2023-03-20 02:15:38] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 14 ms to minimize.
[2023-03-20 02:15:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 545 ms
[2023-03-20 02:15:38] [INFO ] After 708ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-20 02:15:38] [INFO ] After 870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 190/190 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 211 transition count 144
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 165 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 164 transition count 142
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 95 place count 164 transition count 122
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 135 place count 144 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 140 transition count 118
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 140 transition count 118
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 143 place count 140 transition count 115
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 149 place count 137 transition count 115
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 9 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 249 place count 87 transition count 65
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 265 place count 79 transition count 65
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 272 place count 79 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 78 transition count 64
Applied a total of 273 rules in 79 ms. Remains 78 /211 variables (removed 133) and now considering 64/190 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 78/211 places, 64/190 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1456796 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1456796 steps, saw 954451 distinct states, run finished after 3004 ms. (steps per millisecond=484 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 78 cols
[2023-03-20 02:15:42] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-20 02:15:42] [INFO ] [Real]Absence check using 34 positive place invariants in 201 ms returned sat
[2023-03-20 02:15:42] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 02:15:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 02:15:42] [INFO ] After 32ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-20 02:15:42] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-20 02:15:42] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 78/78 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-20 02:15:42] [INFO ] Invariant cache hit.
[2023-03-20 02:15:42] [INFO ] Implicit Places using invariants in 104 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 77/78 places, 64/64 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 77 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 75 transition count 62
Applied a total of 4 rules in 2 ms. Remains 75 /77 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 75 cols
[2023-03-20 02:15:42] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-20 02:15:42] [INFO ] Implicit Places using invariants in 76 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 73/78 places, 62/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 60
Applied a total of 4 rules in 6 ms. Remains 71 /73 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 71 cols
[2023-03-20 02:15:42] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-20 02:15:42] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 02:15:42] [INFO ] Invariant cache hit.
[2023-03-20 02:15:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 02:15:42] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 71/78 places, 60/64 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 427 ms. Remains : 71/78 places, 60/64 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1525117 steps, run timeout after 3001 ms. (steps per millisecond=508 ) properties seen :{}
Probabilistic random walk after 1525117 steps, saw 973004 distinct states, run finished after 3001 ms. (steps per millisecond=508 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:15:46] [INFO ] Invariant cache hit.
[2023-03-20 02:15:46] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-20 02:15:46] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 02:15:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 02:15:46] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-20 02:15:46] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-20 02:15:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-20 02:15:46] [INFO ] After 80ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:15:46] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:15:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2023-03-20 02:15:46] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:15:46] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:15:46] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2023-03-20 02:15:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-20 02:15:46] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 02:15:46] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 71/71 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-20 02:15:46] [INFO ] Invariant cache hit.
[2023-03-20 02:15:46] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-20 02:15:46] [INFO ] Invariant cache hit.
[2023-03-20 02:15:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 02:15:46] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-20 02:15:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 02:15:46] [INFO ] Invariant cache hit.
[2023-03-20 02:15:46] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 71/71 places, 60/60 transitions.
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 71 transition count 60
Applied a total of 17 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 71 cols
[2023-03-20 02:15:47] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-20 02:15:47] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-20 02:15:47] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:15:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 69 ms returned sat
[2023-03-20 02:15:47] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:15:47] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 02:15:47] [INFO ] After 8ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:15:47] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-20 02:15:47] [INFO ] Deduced a trap composed of 6 places in 359 ms of which 1 ms to minimize.
[2023-03-20 02:15:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 419 ms
[2023-03-20 02:15:47] [INFO ] After 477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-20 02:15:47] [INFO ] After 744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 49 stabilizing places and 49 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(X(G(p1))&&G(p2)))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 205 transition count 184
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 203 transition count 182
Applied a total of 16 rules in 26 ms. Remains 203 /211 variables (removed 8) and now considering 182/190 (removed 8) transitions.
// Phase 1: matrix 182 rows 203 cols
[2023-03-20 02:15:48] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-20 02:15:48] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-20 02:15:48] [INFO ] Invariant cache hit.
[2023-03-20 02:15:48] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-20 02:15:48] [INFO ] Invariant cache hit.
[2023-03-20 02:15:49] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/211 places, 182/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 676 ms. Remains : 203/211 places, 182/190 transitions.
Stuttering acceptance computed with spot in 660 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (EQ s43 1) (EQ s40 0)), p2:(EQ s32 1), p1:(EQ s40 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-00 finished in 1487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U (p1 U (p2||G(p1))))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 205 transition count 184
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 203 transition count 182
Applied a total of 16 rules in 13 ms. Remains 203 /211 variables (removed 8) and now considering 182/190 (removed 8) transitions.
// Phase 1: matrix 182 rows 203 cols
[2023-03-20 02:15:49] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-20 02:15:50] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-20 02:15:50] [INFO ] Invariant cache hit.
[2023-03-20 02:15:50] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-20 02:15:50] [INFO ] Invariant cache hit.
[2023-03-20 02:15:50] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/211 places, 182/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 884 ms. Remains : 203/211 places, 182/190 transitions.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s182 1) (EQ s93 1) (EQ s111 1))) (NEQ s172 1)), p1:(NEQ s172 1), p0:(NEQ s178 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/203 stabilizing places and 46/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 p1 p0)
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-003B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-003B-LTLFireability-01 finished in 2095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 210 transition count 144
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 92 place count 165 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 164 transition count 142
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 93 place count 164 transition count 122
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 133 place count 144 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 140 transition count 118
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 140 transition count 118
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 141 place count 140 transition count 115
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 137 transition count 115
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 243 place count 89 transition count 67
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 257 place count 82 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 80 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 260 place count 79 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 260 place count 79 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 264 place count 77 transition count 63
Applied a total of 264 rules in 38 ms. Remains 77 /211 variables (removed 134) and now considering 63/190 (removed 127) transitions.
// Phase 1: matrix 63 rows 77 cols
[2023-03-20 02:15:51] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-20 02:15:52] [INFO ] Implicit Places using invariants in 163 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 188 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/211 places, 63/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 73 transition count 61
Applied a total of 4 rules in 3 ms. Remains 73 /75 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 73 cols
[2023-03-20 02:15:52] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-20 02:15:52] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-20 02:15:52] [INFO ] Invariant cache hit.
[2023-03-20 02:15:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 02:15:52] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/211 places, 61/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 505 ms. Remains : 73/211 places, 61/190 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s26 1)), p0:(NEQ s70 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5289 reset in 228 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-04 finished in 862 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))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 205 transition count 184
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 203 transition count 182
Applied a total of 16 rules in 8 ms. Remains 203 /211 variables (removed 8) and now considering 182/190 (removed 8) transitions.
// Phase 1: matrix 182 rows 203 cols
[2023-03-20 02:15:52] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-20 02:15:52] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-20 02:15:52] [INFO ] Invariant cache hit.
[2023-03-20 02:15:53] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-20 02:15:53] [INFO ] Invariant cache hit.
[2023-03-20 02:15:53] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/211 places, 182/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 203/211 places, 182/190 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s192 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-05 finished in 745 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((p0&&F(p1)))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 206 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 206 transition count 185
Applied a total of 10 rules in 3 ms. Remains 206 /211 variables (removed 5) and now considering 185/190 (removed 5) transitions.
// Phase 1: matrix 185 rows 206 cols
[2023-03-20 02:15:53] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-20 02:15:53] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-20 02:15:53] [INFO ] Invariant cache hit.
[2023-03-20 02:15:54] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2023-03-20 02:15:54] [INFO ] Invariant cache hit.
[2023-03-20 02:15:54] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/211 places, 185/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 973 ms. Remains : 206/211 places, 185/190 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(EQ s132 1), p0:(OR (EQ s179 1) (EQ s189 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-06 finished in 1192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 210 transition count 142
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 163 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 162 transition count 140
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 97 place count 162 transition count 122
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 133 place count 144 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 136 place count 141 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 139 place count 141 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 139 place count 141 transition count 117
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 139 transition count 117
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 247 place count 87 transition count 65
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 261 place count 80 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 78 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 77 transition count 63
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 264 place count 77 transition count 61
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 268 place count 75 transition count 61
Applied a total of 268 rules in 25 ms. Remains 75 /211 variables (removed 136) and now considering 61/190 (removed 129) transitions.
// Phase 1: matrix 61 rows 75 cols
[2023-03-20 02:15:54] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-20 02:15:55] [INFO ] Implicit Places using invariants in 248 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 253 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/211 places, 61/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 71 transition count 59
Applied a total of 4 rules in 2 ms. Remains 71 /73 variables (removed 2) and now considering 59/61 (removed 2) transitions.
// Phase 1: matrix 59 rows 71 cols
[2023-03-20 02:15:55] [INFO ] Computed 31 place invariants in 0 ms
[2023-03-20 02:15:55] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-20 02:15:55] [INFO ] Invariant cache hit.
[2023-03-20 02:15:55] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/211 places, 59/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 654 ms. Remains : 71/211 places, 59/190 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-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:(OR (NEQ s62 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1525 reset in 211 ms.
Product exploration explored 100000 steps with 1565 reset in 247 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 59/59 transitions.
Applied a total of 0 rules in 5 ms. Remains 71 /71 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-20 02:15:56] [INFO ] Invariant cache hit.
[2023-03-20 02:15:57] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-20 02:15:57] [INFO ] Invariant cache hit.
[2023-03-20 02:15:57] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2023-03-20 02:15:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 02:15:57] [INFO ] Invariant cache hit.
[2023-03-20 02:15:57] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 777 ms. Remains : 71/71 places, 59/59 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1557 reset in 200 ms.
Product exploration explored 100000 steps with 1594 reset in 231 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 59/59 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2023-03-20 02:15:58] [INFO ] Invariant cache hit.
[2023-03-20 02:15:59] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-20 02:15:59] [INFO ] Invariant cache hit.
[2023-03-20 02:15:59] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-20 02:15:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 02:15:59] [INFO ] Invariant cache hit.
[2023-03-20 02:15:59] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 569 ms. Remains : 71/71 places, 59/59 transitions.
Treatment of property ShieldPPPt-PT-003B-LTLFireability-07 finished in 4884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U G(p1)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 210 transition count 146
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 167 transition count 144
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 166 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 164 transition count 142
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 93 place count 164 transition count 122
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 133 place count 144 transition count 122
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 137 place count 140 transition count 118
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 140 transition count 118
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 141 place count 140 transition count 115
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 147 place count 137 transition count 115
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 247 place count 87 transition count 65
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 259 place count 81 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 79 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 78 transition count 63
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 262 place count 78 transition count 61
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 266 place count 76 transition count 61
Applied a total of 266 rules in 21 ms. Remains 76 /211 variables (removed 135) and now considering 61/190 (removed 129) transitions.
// Phase 1: matrix 61 rows 76 cols
[2023-03-20 02:15:59] [INFO ] Computed 33 place invariants in 0 ms
[2023-03-20 02:15:59] [INFO ] Implicit Places using invariants in 250 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 250 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/211 places, 61/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 59
Applied a total of 4 rules in 2 ms. Remains 72 /74 variables (removed 2) and now considering 59/61 (removed 2) transitions.
// Phase 1: matrix 59 rows 72 cols
[2023-03-20 02:15:59] [INFO ] Computed 31 place invariants in 0 ms
[2023-03-20 02:15:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 02:15:59] [INFO ] Invariant cache hit.
[2023-03-20 02:16:00] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/211 places, 59/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 588 ms. Remains : 72/211 places, 59/190 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s28 1), p0:(EQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 52485 steps with 0 reset in 93 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-08 finished in 864 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 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 210 transition count 146
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 167 transition count 144
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 166 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 164 transition count 142
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 93 place count 164 transition count 123
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 131 place count 145 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 135 place count 141 transition count 119
Iterating global reduction 4 with 4 rules applied. Total rules applied 139 place count 141 transition count 119
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 139 place count 141 transition count 116
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 145 place count 138 transition count 116
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 247 place count 87 transition count 65
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 259 place count 81 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 79 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 78 transition count 63
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 262 place count 78 transition count 61
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 266 place count 76 transition count 61
Applied a total of 266 rules in 31 ms. Remains 76 /211 variables (removed 135) and now considering 61/190 (removed 129) transitions.
// Phase 1: matrix 61 rows 76 cols
[2023-03-20 02:16:00] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-20 02:16:00] [INFO ] Implicit Places using invariants in 189 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 190 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/211 places, 61/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 59
Applied a total of 4 rules in 2 ms. Remains 72 /74 variables (removed 2) and now considering 59/61 (removed 2) transitions.
// Phase 1: matrix 59 rows 72 cols
[2023-03-20 02:16:00] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-20 02:16:00] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 02:16:00] [INFO ] Invariant cache hit.
[2023-03-20 02:16:00] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/211 places, 59/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 385 ms. Remains : 72/211 places, 59/190 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-09 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:(EQ s51 0), p1:(EQ s54 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 75796 steps with 0 reset in 155 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-09 finished in 677 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(p0))||G(p1)))&&F(p2)))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 204 transition count 183
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 203 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 202 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 202 transition count 181
Applied a total of 18 rules in 7 ms. Remains 202 /211 variables (removed 9) and now considering 181/190 (removed 9) transitions.
// Phase 1: matrix 181 rows 202 cols
[2023-03-20 02:16:01] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-20 02:16:01] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-20 02:16:01] [INFO ] Invariant cache hit.
[2023-03-20 02:16:01] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-20 02:16:01] [INFO ] Invariant cache hit.
[2023-03-20 02:16:01] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 181/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 583 ms. Remains : 202/211 places, 181/190 transitions.
Stuttering acceptance computed with spot in 476 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(OR (EQ s41 0) (EQ s90 0)), p1:(OR (EQ s27 0) (EQ s45 0)), p0:(EQ s117 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 149 ms.
Product exploration explored 100000 steps with 25000 reset in 141 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), true, (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 380 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :2
Finished Best-First random walk after 3114 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=519 )
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), true, (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 382 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 339 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 343 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 202 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 181/181 transitions.
Applied a total of 0 rules in 5 ms. Remains 202 /202 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-20 02:16:04] [INFO ] Invariant cache hit.
[2023-03-20 02:16:04] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-20 02:16:04] [INFO ] Invariant cache hit.
[2023-03-20 02:16:04] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-20 02:16:04] [INFO ] Invariant cache hit.
[2023-03-20 02:16:05] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 202/202 places, 181/181 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 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 369 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 955 steps, including 0 resets, run visited all 3 properties in 25 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 303 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 284 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 346 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 400 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 181/181 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 202 transition count 181
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 42 place count 202 transition count 191
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 202 transition count 191
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 111 place count 202 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 202 transition count 190
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 135 place count 179 transition count 167
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 158 place count 179 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 179 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 177 transition count 165
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 177 transition count 165
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 173 place count 177 transition count 207
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 183 place count 167 transition count 187
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 193 place count 167 transition count 187
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 193 rules in 86 ms. Remains 167 /202 variables (removed 35) and now considering 187/181 (removed -6) transitions.
[2023-03-20 02:16:07] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 187 rows 167 cols
[2023-03-20 02:16:07] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-20 02:16:08] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/202 places, 187/181 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 167/202 places, 187/181 transitions.
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 181/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 202 cols
[2023-03-20 02:16:08] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-20 02:16:08] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-20 02:16:08] [INFO ] Invariant cache hit.
[2023-03-20 02:16:08] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-20 02:16:08] [INFO ] Invariant cache hit.
[2023-03-20 02:16:08] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 202/202 places, 181/181 transitions.
Treatment of property ShieldPPPt-PT-003B-LTLFireability-10 finished in 7464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1))) U !p1))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 210 transition count 143
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 164 transition count 141
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 163 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 162 transition count 140
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 97 place count 162 transition count 120
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 137 place count 142 transition count 120
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 141 place count 138 transition count 116
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 138 transition count 116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 145 place count 138 transition count 114
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 149 place count 136 transition count 114
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 245 place count 88 transition count 66
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 259 place count 81 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 79 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 78 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 262 place count 78 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 266 place count 76 transition count 62
Applied a total of 266 rules in 15 ms. Remains 76 /211 variables (removed 135) and now considering 62/190 (removed 128) transitions.
// Phase 1: matrix 62 rows 76 cols
[2023-03-20 02:16:08] [INFO ] Computed 33 place invariants in 9 ms
[2023-03-20 02:16:08] [INFO ] Implicit Places using invariants in 76 ms returned [57, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/211 places, 62/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 60
Applied a total of 4 rules in 1 ms. Remains 72 /74 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 72 cols
[2023-03-20 02:16:08] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-20 02:16:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-20 02:16:08] [INFO ] Invariant cache hit.
[2023-03-20 02:16:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:16:08] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/211 places, 60/190 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 230 ms. Remains : 72/211 places, 60/190 transitions.
Stuttering acceptance computed with spot in 117 ms :[p1, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s3 1), p0:(EQ s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Product exploration explored 100000 steps with 1 reset in 231 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/72 stabilizing places and 2/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 494 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[p1, (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 535 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[p1, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[p1, (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-20 02:16:11] [INFO ] Invariant cache hit.
[2023-03-20 02:16:11] [INFO ] [Real]Absence check using 31 positive place invariants in 144 ms returned sat
[2023-03-20 02:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:16:11] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-20 02:16:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:16:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-20 02:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:16:11] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-20 02:16:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:16:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-20 02:16:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-20 02:16:11] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2023-03-20 02:16:11] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2023-03-20 02:16:11] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2023-03-20 02:16:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 237 ms
[2023-03-20 02:16:11] [INFO ] Computed and/alt/rep : 56/101/56 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 02:16:12] [INFO ] Added : 38 causal constraints over 8 iterations in 121 ms. Result :sat
Could not prove EG p1
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 60/60 transitions.
Applied a total of 0 rules in 15 ms. Remains 72 /72 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-20 02:16:12] [INFO ] Invariant cache hit.
[2023-03-20 02:16:12] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-20 02:16:12] [INFO ] Invariant cache hit.
[2023-03-20 02:16:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:16:12] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-20 02:16:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 02:16:12] [INFO ] Invariant cache hit.
[2023-03-20 02:16:12] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 421 ms. Remains : 72/72 places, 60/60 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/72 stabilizing places and 2/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 417 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[p1, (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 455 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[p1, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[p1, (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-20 02:16:14] [INFO ] Invariant cache hit.
[2023-03-20 02:16:14] [INFO ] [Real]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-20 02:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:16:14] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-20 02:16:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:16:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2023-03-20 02:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:16:14] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-20 02:16:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:16:14] [INFO ] [Nat]Added 2 Read/Feed constraints in 22 ms returned sat
[2023-03-20 02:16:14] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-20 02:16:14] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2023-03-20 02:16:14] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2023-03-20 02:16:14] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-20 02:16:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 202 ms
[2023-03-20 02:16:14] [INFO ] Computed and/alt/rep : 56/101/56 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 02:16:14] [INFO ] Added : 38 causal constraints over 8 iterations in 171 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 129 ms :[p1, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 13 reset in 169 ms.
Product exploration explored 100000 steps with 14 reset in 181 ms.
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-20 02:16:15] [INFO ] Invariant cache hit.
[2023-03-20 02:16:15] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-20 02:16:15] [INFO ] Invariant cache hit.
[2023-03-20 02:16:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:16:15] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-20 02:16:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 02:16:15] [INFO ] Invariant cache hit.
[2023-03-20 02:16:15] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 504 ms. Remains : 72/72 places, 60/60 transitions.
Treatment of property ShieldPPPt-PT-003B-LTLFireability-11 finished in 7108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 204 transition count 183
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 203 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 202 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 202 transition count 181
Applied a total of 18 rules in 26 ms. Remains 202 /211 variables (removed 9) and now considering 181/190 (removed 9) transitions.
// Phase 1: matrix 181 rows 202 cols
[2023-03-20 02:16:15] [INFO ] Computed 34 place invariants in 28 ms
[2023-03-20 02:16:15] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-20 02:16:15] [INFO ] Invariant cache hit.
[2023-03-20 02:16:16] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-20 02:16:16] [INFO ] Invariant cache hit.
[2023-03-20 02:16:16] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 181/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 848 ms. Remains : 202/211 places, 181/190 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (NEQ s87 1) (NEQ s89 1)), p0:(OR (NEQ s87 1) (NEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-003B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-003B-LTLFireability-14 finished in 1706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 210 transition count 143
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 164 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 163 transition count 141
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 95 place count 163 transition count 121
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 135 place count 143 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 139 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 139 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 143 place count 139 transition count 114
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 149 place count 136 transition count 114
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 245 place count 88 transition count 66
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 261 place count 80 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 78 transition count 64
Applied a total of 263 rules in 25 ms. Remains 78 /211 variables (removed 133) and now considering 64/190 (removed 126) transitions.
// Phase 1: matrix 64 rows 78 cols
[2023-03-20 02:16:17] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-20 02:16:17] [INFO ] Implicit Places using invariants in 106 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/211 places, 64/190 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 77 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 75 transition count 62
Applied a total of 4 rules in 1 ms. Remains 75 /77 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 75 cols
[2023-03-20 02:16:17] [INFO ] Computed 33 place invariants in 0 ms
[2023-03-20 02:16:17] [INFO ] Implicit Places using invariants in 67 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/211 places, 62/190 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 71 transition count 60
Applied a total of 4 rules in 17 ms. Remains 71 /73 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 71 cols
[2023-03-20 02:16:17] [INFO ] Computed 31 place invariants in 0 ms
[2023-03-20 02:16:17] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 02:16:17] [INFO ] Invariant cache hit.
[2023-03-20 02:16:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 02:16:17] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 71/211 places, 60/190 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 427 ms. Remains : 71/211 places, 60/190 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s54 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 13197 steps with 0 reset in 24 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-15 finished in 540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(p0))||G(p1)))&&F(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1))) U !p1))'
[2023-03-20 02:16:18] [INFO ] Flatten gal took : 26 ms
[2023-03-20 02:16:18] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 02:16:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 211 places, 190 transitions and 488 arcs took 5 ms.
Total runtime 46997 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-003B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability
FORMULA ShieldPPPt-PT-003B-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-003B-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-003B-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679278578726
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 6 (type EXCL) for 3 ShieldPPPt-PT-003B-LTLFireability-10
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for ShieldPPPt-PT-003B-LTLFireability-10
lola: result : true
lola: markings : 8
lola: fired transitions : 8
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPt-PT-003B-LTLFireability-07
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 1 (type EXCL) for ShieldPPPt-PT-003B-LTLFireability-07
lola: result : false
lola: markings : 906
lola: fired transitions : 1235
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 3 ShieldPPPt-PT-003B-LTLFireability-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for ShieldPPPt-PT-003B-LTLFireability-10
lola: result : false
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 10 ShieldPPPt-PT-003B-LTLFireability-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for ShieldPPPt-PT-003B-LTLFireability-11
lola: result : false
lola: markings : 53
lola: fired transitions : 54
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-003B-LTLFireability-07: LTL false LTL model checker
ShieldPPPt-PT-003B-LTLFireability-10: CONJ true CONJ
ShieldPPPt-PT-003B-LTLFireability-11: LTL false LTL model checker
Time elapsed: 0 secs. Pages in use: 1
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-003B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPt-PT-003B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715400572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-003B.tgz
mv ShieldPPPt-PT-003B 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 ;